### Abstract

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 language | English (US) |
---|---|

Pages (from-to) | 1-18 |

Number of pages | 18 |

Journal | Discrete Analysis |

Volume | 2 |

Issue number | 2018 |

DOIs | |

State | Published - Jan 1 2018 |

### Keywords

- Independent set
- Kneser graph
- Product graphs

### ASJC Scopus subject areas

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

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

## Cite this

Friedgut, E., & Regev, O. (2018). Kneser graphs are like swiss cheese.

*Discrete Analysis*,*2*(2018), 1-18. https://doi.org/10.19086/da3103