The -density conjecture in -free -graphs
Let be the -vertex -graph with exactly two edges, and let denote its maximum asymptotic induced density in a -free -graph.
The -density conjecture.
The lower bound is attained by a balanced iterated blow-up of ; the source's numerical upper bound remains slightly above .
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.