Kneser graphs are like swiss cheese

Ehud Friedgut, Oded Regev

Research output: Contribution to journalArticlepeer-review


We prove that for a large family of product graphs, and for Kneser graphs K(n,αn) with fixed α < 1/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 of [3] and [2], and show that any independent set in these graphs is almost contained in an independent set which depends on few coordinates. Our proof is inspired by, and follows some of the main ideas of, Fox's proof of the graph removal lemma [6].

Original languageEnglish
Number of pages18
JournalDiscrete Analysis
StatePublished - 23 Jan 2018

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Kneser graphs are like swiss cheese'. Together they form a unique fingerprint.

Cite this