Random Kneser Graphs and Hypergraphs
Random Kneser Graphs and Hypergraphs
The Kneser graph $KG_{n,k}$ is the graph whose vertices are the $k$-element subsets of $[n],$ with two vertices adjacent if and only if the corresponding sets are disjoint. A famous result due to Lovász states that the chromatic number of $KG_{n,k}$ is equal to $n-2k+2$. In this paper we discuss …