Mubayi–Pikhurko–Sudakov conjecture on Turán densities of tight cycles minus one edge

Let CC_\ell^{-} denote the 3-uniform tight cycle of length \ell with one edge removed, and let π(F)\pi(F) denote the Turán density of a 3-uniform hypergraph FF.

Mubayi–Pikhurko–Sudakov conjecture. If 5\ell\geq 5 is not divisible by three, then

π(C)=14.\pi\bigl(C_\ell^{-}\bigr)=\frac{1}{4}.

A recursive construction gives CC_\ell^{-}-free 3-uniform hypergraphs of density 1/4o(1)1/4-o(1) for such llll, establishing the lower bound; the asserted matching upper bound remains open in the source.

Sources & referencesView supporting material

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.