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

From papers

Let 4.24.2 be the 44-vertex 33-graph with exactly two edges, and let π4.2(K4)\pi_{4.2}(K_4^-) denote its maximum asymptotic induced density in a K4K_4^--free 33-graph.

The 4.24.2-density conjecture.

π4.2(K4)=24/43.\pi_{4.2}(K_4^-)=24/43.

The lower bound is attained by a balanced iterated blow-up of H6H_6; the source's numerical upper bound remains slightly above 24/4324/43.

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.