On “stability” in the Erdös--Ko--Rado Theorem
From MaRDI portal
Publication:2813346
DOI10.1137/15M1012992zbMath1338.05130arXiv1502.05692MaRDI QIDQ2813346
Publication date: 23 June 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.05692
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (20)
Log-Sobolev inequality for the multislice, with applications ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Stability for vertex isoperimetry in the cube ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ On the random version of the Erdős matching conjecture ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On stability of the independence number of a certain distance graph ⋮ Random Kneser graphs and hypergraphs ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ Unnamed Item ⋮ On the Hadwiger number of Kneser graphs and their random subgraphs ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Vertex-isoperimetric stability in the hypercube ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Unnamed Item
- A simple removal lemma for large nearly-intersecting families
- Hypergraph containers
- On the stability of the Erdős-Ko-Rado theorem
- Logarithmic Sobolev inequality for some models of random walks
- Intersecting families of discrete structures are typically trivial
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
- Erdős–Ko–Rado in Random Hypergraphs
- On Erdős–Ko–Rado for Random Hypergraphs II
- On Erdős–Ko–Rado for random hypergraphs I
- Independent sets in hypergraphs
- Extremal Results in Random Graphs
This page was built for publication: On “stability” in the Erdös--Ko--Rado Theorem
