Erdős–Ko–Rado in Random Hypergraphs

DOI10.1017/S0963548309990253zbMath1193.05118MaRDI QIDQ3552495

József Balogh, Tom Bohman, Dhruv Mubayi

Publication date: 22 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

random uniform hypergraphErdoes-Ko-Rado theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (18)

TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ Applications of graph containers in the Boolean lattice ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ On the stability of the Erdös-Ko-Rado theorem ⋮ Turánnical hypergraphs ⋮ Large cliques in sparse random intersection graphs ⋮ Intersecting families of discrete structures are typically trivial ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ On “stability” in the Erdös--Ko--Rado Theorem ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ Triangle-free subgraphs of hypergraphs ⋮ On Erdős–Ko–Rado for random hypergraphs I ⋮ On the Chromatic Index of Random Uniform Hypergraphs ⋮ On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method

Cites Work

• On \(K^ 4\)-free subgraphs of random graphs
• Covering by intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Randomly generated intersecting hypergraphs II
• Turán's theorem in sparse random graphs

This page was built for publication: Erdős–Ko–Rado in Random Hypergraphs