Kneser graphs are like Swiss cheese
arXiv: Combinatorics, pp. 31032018.
We prove that for a large family of product graphs, and for Kneser graphs $K(n,alpha n)$ with fixed $alpha u003c1/2$, the following holds. Any set of vertices that spans a small proportion of the edges in the graph can be made independent by removing a small proportion of the vertices of the graph. This allows us to strengthen the results...More
Full Text (Upload PDF)
PPT (Upload PPT)