Erdős-Ko-Rado in random hypergraphs

DOI10.1017/S0963548309990253MaRDI QIDQ3552495zbMATH OpenFDO

Authors József Balogh, Tom Bohman, Dhruv Mubayi

Publication date 22 April 2010

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

Full work available at URL https://doi.org/10.1017/S0963548309990253

zbMATH Keywords

Erdoes-Ko-Rado theoremrandom uniform hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
• On Erdős-Ko-Rado for random hypergraphs. II
• On Erdős-Ko-Rado for random hypergraphs. I
• Sharp threshold for the Erdős–Ko–Rado theorem
• On the stability of the Erdős-Ko-Rado theorem

Cites work

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

Cited in

(30)

• On a problem of Erdős and Lovász: Random lines in a projective plane
• Two-regular subgraphs of odd-uniform hypergraphs
• Triangle-free subgraphs of hypergraphs
• Intersecting families of discrete structures are typically trivial
• Most probably intersecting hypergraphs
• On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
• On randomly generated non-trivially intersecting hypergraphs
• Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
• Removal and stability for Erdős-Ko-Rado
• On ``stability in the Erdős-Ko-Rado theorem
• Applications of graph containers in the Boolean lattice
• A simple removal lemma for large nearly-intersecting families
• Transference for the Erdős-Ko-Rado theorem
• Partial covering arrays and a generalized Erdős-Ko-Rado property
• Turánnical hypergraphs
• On the stability of the Erdös-Ko-Rado theorem
• Maximum size intersecting families of bounded minimum positive co-degree
• On Erdős-Ko-Rado for random hypergraphs. II
• On Erdős-Ko-Rado for random hypergraphs. I
• On the chromatic index of random uniform hypergraphs
• Large cliques in sparse random intersection graphs
• Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
• Sharp threshold for the Erdős–Ko–Rado theorem
• Sidorenko hypergraphs and random Turán numbers
• Robustness of Erdős-Ko-Rado theorems on permutations and perfect matchings
• On the matching problem in random hypergraphs
• Johnson graphs, their random subgraphs, and some of their extremal characteristics
• A sharp threshold for a random version of Sperner's theorem
• Probabilistic extensions of the Erdős-Ko-Rado property
• On the stability of the Erdős-Ko-Rado theorem

This page was built for publication: Erdős-Ko-Rado in random hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552495)