On the stability of the Erdős-Ko-Rado theorem
From MaRDI portal
Publication:889512
DOI10.1016/j.jcta.2015.08.002zbMath1325.05145arXiv1408.1288OpenAlexW2290417165MaRDI QIDQ889512
Bhargav P. Narayanan, Béla Bollobás, Andrei M. Raigorodskii
Publication date: 6 November 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1288
Related Items (36)
On random subgraphs of Kneser and Schrijver graphs ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Independence numbers of random subgraphs of distance graphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Diameters of random distance graphs ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Independence numbers of random subgraphs of some distance graph ⋮ Chromatic numbers of some distance graphs ⋮ A generalization of Kneser graphs ⋮ Stability for vertex isoperimetry in the cube ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ On the stability of the independence number of a random subgraph ⋮ On the random version of the Erdős matching conjecture ⋮ A structure theorem for almost low-degree functions on the slice ⋮ 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 chromatic number of a random subgraph of the Kneser graph ⋮ On random subgraphs of Kneser graphs and their generalizations ⋮ On the Hadwiger number of Kneser graphs and their random subgraphs ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ 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 “stability” in the Erdös--Ko--Rado Theorem ⋮ Large cycles in random generalized Johnson graphs ⋮ Clique numbers of random subgraphs of some distance graphs ⋮ New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ Degree versions of theorems on intersecting families via stability ⋮ Regular intersecting families ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- Set systems without a simplex or a cluster
- On the measure of intersecting families, uniqueness and stability
- Ramsey properties of random hypergraphs
- The primes contain arbitrarily long arithmetic progressions
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- Ramsey properties of random discrete structures
- Extremal subgraphs of random graphs
- Mantel's theorem for random graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Erdős–Ko–Rado in Random Hypergraphs
- Intersecting Families are Essentially Contained in Juntas
- Rado Partition Theorem for Random Subsets of Integers
- Extremal subgraphs of random graphs
- Threshold Functions for Ramsey Properties
- Arithmetic progressions of length three in subsets of a random set
- Independent sets in hypergraphs
- The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximal sum-free sets of elements of finite groups
- On Certain Sets of Integers
This page was built for publication: On the stability of the Erdős-Ko-Rado theorem
