The H9 non-extremality conjecture in the second parameter region
Let , let be the second region defined in the paper, and let be the specified tripartite graph. For a weighting , means that it is a weighted tripartite graph with the prescribed edge densities. A graph is extremal if its triangle density equals , and vertex minimal if no graph with the same triangle density has fewer vertices. H9 non-extremality conjecture. If , then every weighting such that makes either non-extremal or non-vertex-minimal. The source states this as a sufficient conjecture for proving the proposed piecewise formula, with no resolution supplied.
References
Primary source
Rahil Baber, J. Robert Johnson and John Talbot, “The minimal density of triangles in tripartite graphs”, arXiv:0910.1237 (2009).
Progress summary
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.