The -density conjecture in -free -graphs
Let be a -graph and let be the complete -graph on four vertices with one edge removed. For a forbidden -graph , write for the maximum asymptotic induced density of in an -free -graph.
The -density conjecture.
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.
References
Primary source
Victor Falgas-Ravry and Emil R. Vaughan, “Turán H-densities for 3-graphs”, arXiv:1201.4326 (2012).
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.