Mubayi–Pikhurko–Sudakov conjecture on Turán densities of tight cycles minus one edge
Let denote the 3-uniform tight cycle of length with one edge removed, and let denote the Turán density of a 3-uniform hypergraph .
Mubayi–Pikhurko–Sudakov conjecture. If is not divisible by three, then
A recursive construction gives -free 3-uniform hypergraphs of density for such , establishing the lower bound; the asserted matching upper bound remains open in the source.
References
Primary source
Simón Piga, Marcelo Sales and Bjarne Schülke, “The codegree Turán density of tight cycles minus one edge”, arXiv:2211.12721 (2022).
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.