An extension of Mantel's theorem to random 4-uniform hypergraphs

Ran Gu, Xueliang Li, Zhongmei Qin +2

A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. DeMarco and…