The K4K_4^--density conjecture in C5C_5-free 33-graphs

From papers

Let C5C_5 be a 33-graph and let K4K_4^- be the complete 33-graph on four vertices with one edge removed. For a forbidden 33-graph FF, write πK4(F)\pi_{K_4^-}(F) for the maximum asymptotic induced density of K4K_4^- in an FF-free 33-graph.

The K4K_4^--density conjecture.

πK4(C5)=46((2+1)1/3(21)1/3).\pi_{K_4^-}(C_5)=4-6\left((\sqrt{2}+1)^{1/3}-(\sqrt{2}-1)^{1/3}\right).

This is the lower bound supplied by the iterated unbalanced blow-up construction; the source records only numerical upper and lower bounds, so equality remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Victor Falgas-Ravry and Emil R. Vaughan, “Turán H-densities for 3-graphs”, arXiv:1201.4326 (2012).

Solutions 0

No solutions have been posted yet.