Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability

DOI10.1017/S0963548316000420zbMath1371.05267arXiv1409.3634OpenAlexW2964140078MaRDI QIDQ5366954

Marcelo Matheus Gauy, Igor C. Oliveira, Hệp Hàn

Publication date: 10 October 2017

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

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

zbMATH Keywords

random \(k\)-uniform hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items

Polynomial configurations in subsets of random and pseudo-random sets ⋮ A simple removal lemma for large nearly-intersecting families ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Large cliques in sparse random intersection graphs ⋮ Intersecting families of discrete structures are typically trivial ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ On the Chromatic Index of Random Uniform Hypergraphs ⋮ Counting independent sets in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• On the stability of the Erdős-Ko-Rado theorem
• On the measure of intersecting families, uniqueness and stability
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• On the number of graphs without 4-cycles
• An extremal problem for random graphs and the number of graphs with large even-girth
• Graph products, Fourier analysis and spectral techniques
• 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
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Erdős–Ko–Rado in Random Hypergraphs
• On the Shannon capacity of a graph
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• On Erdős–Ko–Rado for Random Hypergraphs II
• On Erdős–Ko–Rado for random hypergraphs I
• Independent sets in hypergraphs
• Stability results for random discrete structures

This page was built for publication: Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability