REVIEW
On the Maximum F₅-free Subhypergraphs of a Random Hypergraph
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
On the Maximum F₅-free Subhypergraphs of a Random Hypergraph
read the original 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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.