The -density conjecture for -free -graphs
The -density conjecture for -free -graphs
From papers
Let be the complete -graph on four vertices with one edge removed, let be the forbidden -graph, and let denote the corresponding Turán density.
The -density conjecture.
The lower bound comes from an iterated balanced blow-up of a -edge, while the source gives an upper bound below ; 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
Sign in to submit a solution.
No solutions have been posted yet.