A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On the chromatic number of a random subgraph of the Kneser graph
2017
Doklady. Mathematics
Given positive integers n ≥ 2k, a Kneser graph KG n,k is a graph whose vertex set is the collection of all k-element subsets of the set {1, . . . , n}, with edges connecting pairs of disjoint sets. A famous result due to L. Lovász states that the chromatic number of KG n,k is equal to n − 2k + 2. In this paper, we study the random Kneser graph KG n,k (p), obtained from KG n,k by including each of the edges of KG n,k independently and with probability p. We prove that, for any fixed k ≥ 3, χ(KG
doi:10.1134/s1064562417050209
fatcat:2uc7afkbsbcexi64npoh24vfie