Mantel's theorem for random hypergraphs
From MaRDI portal
Publication:5740269
DOI10.1002/rsa.20629zbMath1341.05176arXiv1310.1501OpenAlexW1566250144WikidataQ115150364 ScholiaQ115150364MaRDI QIDQ5740269
József Balogh, Ping Hu, John Lenz, Jane V. Butterfield
Publication date: 25 July 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.1501
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)
Related Items (3)
On the maximum \(F_5\)-free subhypergraphs of a random hypergraph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On \(k\)-uniform random hypergraphs without generalized fans
Cites Work
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- An exact result for 3-graphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Stability theorems for cancellative hypergraphs
- Mantel's theorem for random graphs
- Extremal subgraphs of random graphs
- Independent sets in hypergraphs
- On the Chromatic Thresholds of Hypergraphs
- Stability results for random discrete structures
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: Mantel's theorem for random hypergraphs
