Piecewise growth-rate conjecture for
Piecewise growth-rate conjecture for
Let be the random 3-uniform hypergraph on vertices, let be the 3-uniform expansion of the 4-cycle, and let be the largest number of edges in a -free subgraph. Piecewise growth-rate conjecture. One should have
This gives a complete conjectural description of the random Turán number, including the 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.