# On random subgraphs of Kneser and Schrijver graphs

@article{Kupavskii2015OnRS,
title={On random subgraphs of Kneser and Schrijver graphs},
author={Andrey B. Kupavskii},
journal={ArXiv},
year={2015},
volume={abs/1502.00699}
}
• Mathematics, Computer Science
J. Comb. Theory, Ser. B
• 2022
A purely combinatorial approach to the problem based on blow-ups of graphs, which gives much better bounds on the chromatic number of random Kneser and Schrijver graphs and Knesers hypergraphs.
• Mathematics
• 2018
The Kneser hypergraph ${\rm KG}^r_{n,k}$ is an $r$-uniform hypergraph with vertex set consisting of all $k$-subsets of $\{1,\ldots,n\}$ and any collection of $r$ vertices forms an edge if their
• Mathematics
• 2018
Given a graph $G$ and $p \in [0,1]$, let $G_p$ denote the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. Alon, Krivelevich, and Sudokov proved $\mathbb{E} • Mathematics Random Struct. Algorithms • 2023 For positive integers n$$n$$ and k$$k$$ with n≥2k+1$$n\ge 2k+1$$ , the Kneser graph K(n,k)$$K\left(n,k\right)$$ is the graph with vertex set consisting of all k$$k$$ ‐sets of {1,…,n}$\$
This paper considers the so-called distance graph G(n, r, s);its vertices can be identified with the r-element subsets of the set {1, 2,…,n}, and two vertices are joined by an edge if the size of the
This paper considers the so-called distance graph G(n, r, s);its vertices can be identified with the r-element subsets of the set {1, 2,…,n}, and two vertices are joined by an edge if the size of the