Sharp threshold for the Erdős–Ko–Rado theorem

DOI10.1002/rsa.21090zbMath1522.05478arXiv2105.02985OpenAlexW4224134074WikidataQ113913005 ScholiaQ113913005MaRDI QIDQ6077048

Haoran Luo, József Balogh, Robert A. Krueger

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

transferencehitting timeKneser graphintersecting families

Mathematics Subject Classification ID

Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Lower bound on the minimum number of edges in subgraphs of Johnson graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• On the stability of the Erdős-Ko-Rado theorem
• Diversity of uniform intersecting families
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Intersecting families of discrete structures are typically trivial
• Structure and supersaturation for intersecting families
• Removal and Stability for Erdös--Ko--Rado
• On “stability” in the Erdös--Ko--Rado Theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Erdős–Ko–Rado in Random Hypergraphs
• On the number of connected subgraphs with small edge‐boundary in regular graphs
• On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
• On Erdős–Ko–Rado for Random Hypergraphs II
• On Erdős–Ko–Rado for random hypergraphs I
• Independent sets in hypergraphs
• Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Sharp threshold for the Erdős–Ko–Rado theorem