TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
From MaRDI portal
Publication:3449986
DOI10.1017/fms.2015.21zbMath1323.05128arXiv1609.01001OpenAlexW2197142428MaRDI QIDQ3449986
Bhargav P. Narayanan, József Balogh, Béla Bollobás
Publication date: 2 November 2015
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.01001
Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
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 ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Stability results for vertex Turán problems in Kneser graphs ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Independence numbers of random subgraphs of some distance graph ⋮ 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 ⋮ 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 ⋮ On “stability” in the Erdös--Ko--Rado Theorem ⋮ 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
- Set systems without a simplex or a cluster
- Shadows and intersections: Stability and new proofs
- On the measure of intersecting families, uniqueness and stability
- On the number of graphs without 4-cycles
- Intersecting families of discrete structures are typically trivial
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős–Ko–Rado in Random Hypergraphs
- Intersecting Families are Essentially Contained in Juntas
- On the Shannon capacity of a graph
- Rado Partition Theorem for Random Subsets of Integers
- Extremal subgraphs of random graphs
- Threshold Functions for Ramsey Properties
- Independent sets in hypergraphs
- Extremal Results in Random Graphs
- On generalized graphs
- On separating systems of a finite set
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
