The extension of Theorem on the forbidden graphs and
Let denote the minimum asymptotic density of -cliques among graphs avoiding both and . Theorem's extension conjecture. The conclusions of the theorem concerning , in particular
hold for every . The paper does not pursue the proof of this extension; it would remove the stated restriction on in the theorem.
References
Primary source
Levente Bodnár and Oleg Pikhurko, “On problems of Erdős and Baumann-Briggs on minimising the density of s-cliques in graphs with forbidden subgraphs”, arXiv:2602.17412 (2026).
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.