An extension of Mantel's theorem to random 4-uniform hypergraphs
Ran Gu, Xueliang Li, Zhongmei Qin, Yongtang Shi, Kang Yang

TL;DR
This paper extends Mantel's theorem to random 4-uniform hypergraphs, showing that for certain probabilities, maximum $T_4$-free subhypergraphs are w.h.p. 4-partite, generalizing previous results for smaller uniformities.
Contribution
It proves that for $p > K rac{ ext{log} n}{n}$, maximum $T_4$-free subhypergraphs in $G^4(n,p)$ are w.h.p. 4-partite, extending extremal hypergraph results to the 4-uniform case.
Findings
Maximum $T_4$-free subhypergraphs are 4-partite for $p > K rac{ ext{log} n}{n}$
Extends extremal hypergraph results to random 4-uniform hypergraphs
Generalizes previous results from 3-uniform to 4-uniform hypergraphs.
Abstract
A sparse version of Mantel's Theorem is that, for sufficiently large , with high probability (w.h.p.), every maximum triangle-free subgraph of is bipartite. DeMarco and Kahn proved this for for some constant , and apart from the value of the constant, this bound is the best possible. Denote by the 3-uniform hypergraph with vertex set and edge set . Frankl and F\"uredi showed that the maximum 3-uniform hypergraph on vertices containing no copy of is tripartite for . For some integer , let be the random -uniform hypergraph. Balogh et al. proved that for for some constant , every maximum -free subhypergraph of w.h.p. is tripartite and it does not hold when . Denote by the 4-uniform hypergraph with vertex set…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph theory and applications
