On the Maximum $F_5$-free Subhypergraphs of a Random Hypergraph
Authors:
Preprint
Abstract
Denote by $F_5$ the $3$-uniform hypergraph on vertex set $\{1,2,3,4,5\}$ with hyperedges $\{123,124,345\}$. Balogh, Butterfield, Hu, and Lenz proved that if $p > K \log n / n$ for some large constant $K$, then every maximum $F_5$-free subhypergraph of $G^3(n,p)$ is tripartite with high probability, and showed that if $p_0 = 0.1\sqrt{\log n} / n$, then with high probability there exists a maximum $F_5$-free subhypergraph of $G^3(n,p_0)$ that is not tripartite. In this paper, we sharpen the upper bound to be best possible up to a constant factor. We prove that if $p > C \sqrt{\log n} / n $ for some large constant $C$, then every maximum $F_5$-free subhypergraph of $G^3(n, p)$ is tripartite with high probability.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Extremal results for random discrete structuresAnnals of Mathematics, 2016
- Combinatorial theorems in sparse random setsAnnals of Mathematics, 2016
- Mantel's theorem for random hypergraphsRandom Structures & Algorithms, 2016
- Mantel's theorem for random graphsRandom Structures & Algorithms, 2014
- Stability results for random discrete structuresRandom Structures & Algorithms, 2012
- Extremal subgraphs of random graphsJournal of Graph Theory, 1990
- Three-graphs without two triples whose symmetric difference is contained in a thirdDiscrete Mathematics, 1974