On Erdős–Ko–Rado for Random Hypergraphs II

DOI10.1017/S0963548318000433zbMath1434.05153arXiv1406.5793OpenAlexW2962779151MaRDI QIDQ5219311

No author found.

Publication date: 11 March 2020

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

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

zbMATH Keywords

Sperner's theoremErdős-Ko-Rado property

Mathematics Subject Classification ID

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

Related Items

A simple removal lemma for large nearly-intersecting families, The number of maximal independent sets in the Hamming cube, 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, On Erdős–Ko–Rado for random hypergraphs I

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• A random version of Sperner's theorem
• Hypergraph containers
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• On \(K^ 4\)-free subgraphs of random graphs
• Maximum antichains in random subsets of a finite set
• Maximum-size antichains in random set-systems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős–Ko–Rado in Random Hypergraphs
• On sets of integers containing k elements in arithmetic progression
• Extremal subgraphs of random graphs
• Threshold Functions for Ramsey Properties
• Independent sets in hypergraphs
• Extremal Results in Random Graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS