On Erdős–Ko–Rado for random hypergraphs I
From MaRDI portal
Publication:5222562
DOI10.1017/S0963548319000117zbMath1436.05109arXiv1412.5085OpenAlexW2963152311MaRDI QIDQ5222562
No author found.
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5085
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (6)
A simple removal lemma for large nearly-intersecting families ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- On \(K^ 4\)-free subgraphs of random graphs
- A BK inequality for randomly drawn subsets of fixed size
- Intersecting families of discrete structures are typically trivial
- Towards a theory of negative dependence
- Mantel's theorem for random graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Thresholds and Expectation Thresholds
- Erdős–Ko–Rado in Random Hypergraphs
- On sets of integers containing k elements in arithmetic progression
- Balls and bins: A study in negative dependence
- Extremal subgraphs of random graphs
- Threshold Functions for Ramsey Properties
- On Erdős–Ko–Rado for Random Hypergraphs II
- Extremal Results in Random Graphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: On Erdős–Ko–Rado for random hypergraphs I
