Piecewise growth-rate conjecture for ex(Gn,p(3),C4(3))\operatorname{ex}(G_{n,p}^{(3)},C_4^{(3)})

Let Gn,p(3)G_{n,p}^{(3)} be the random 3-uniform hypergraph on nn vertices, let C4(3)C_4^{(3)} be the 3-uniform expansion of the 4-cycle, and let ex(Gn,p(3),C4(3))\operatorname{ex}(G_{n,p}^{(3)},C_4^{(3)}) be the largest number of edges in a C4(3)C_4^{(3)}-free subgraph. Piecewise C4(3)C_4^{(3)} growth-rate conjecture. One should have

ex(Gn,p(3),C4(3))={(1+o(1))e(Gn,p(3)),ifn3pn5/3,Θ(n4/3+o(1)),ifn5/3pn2/3,Θ(pn2),otherwise.\operatorname{ex}\left(G_{n,p}^{(3)}, C_{4}^{(3)}\right) = \begin{cases} (1+o(1))e(G_{n,p}^{(3)}), & \operatorname{if } {n^{-3}\ll p \ll n^{-5/3}},\\ \Theta(n^{4/3+o(1)}), & \operatorname{if } {n^{-5/3}\ll p \ll n^{-2/3} },\\ \Theta(pn^{2}),& \operatorname{otherwise.} \end{cases}

This gives a complete conjectural description of the random Turán number, including the n4/3n^{4/3} middle regime. The paper presents this as an open problem; the displayed formula is the fullest version of the preceding conjectural growth-rate statement.

Sources & referencesView supporting material

Primary source

Dhruv Mubayi and Liana Yepremyan, “Random Turán theorem for hypergraph cycles”, arXiv:2007.10320 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.