Kneser graphs are like Swiss cheese

DOI10.19086/da.3103zbMath1404.05088arXiv1702.04073OpenAlexW2963774049MaRDI QIDQ4645027

Ehud Friedgut, Oded Regev

Publication date: 9 January 2019

Published in: Discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.04073

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Related Items (7)

On symmetric intersecting families of vectors ⋮ KKL's influence on me ⋮ On arithmetic progressions in symmetric sets in finite field model ⋮ High dimensional Hoffman bound and applications in extremal combinatorics ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ On set systems without a simplex-cluster and the junta method ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems

Cites Work

• Unnamed Item
• A new proof of the graph removal lemma
• On the removal lemma for linear systems over abelian groups
• Noise stability of functions with low influences: invariance and optimality
• A removal lemma for systems of linear equations over finite fields
• Independent sets in graph powers are almost contained in juntas
• An Arithmetic Analogue of Fox's Triangle Removal Argument
• Removal and Stability for Erdös--Ko--Rado
• Intersecting Families are Essentially Contained in Juntas
• Conditional Hardness for Approximate Coloring
• On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors

This page was built for publication: Kneser graphs are like Swiss cheese