The K4K_4^--density conjecture for (K4,C5)(K_4^-,C_5)-free 33-graphs

From papers

Let K4K_4^- be the complete 33-graph on four vertices with one edge removed, let C5C_5 be the forbidden 33-graph, and let π(K4,C5)\pi(K_4^-,C_5) denote the corresponding Turán density.

The K4K_4^--density conjecture.

π(K4,C5)=1/4.\pi(K_4^-,C_5)=1/4.

The lower bound comes from an iterated balanced blow-up of a 33-edge, while the source gives an upper bound below 0.2510730.251073; the conjectured equality is unresolved.

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.