On the maximum \(F_5\)-free subhypergraphs of a random hypergraph

DOI10.37236/11328arXiv2203.02826MaRDI QIDQ6117240

Igor Araujo, Haoran Luo, József Balogh

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal problemsTurán numberrandom hypergraphs

Mathematics Subject Classification ID

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

Cites Work

• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• Three-graphs without two triples whose symmetric difference is contained in a third
• Modular statistics for subgraph counts in sparse random graphs
• Mantel's theorem for random graphs
• Extremal subgraphs of random graphs
• Independent sets in hypergraphs
• Stability results for random discrete structures
• Mantel's theorem for random hypergraphs
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: On the maximum \(F_5\)-free subhypergraphs of a random hypergraph