The extension of Theorem on the forbidden graphs K3\overline{K}_3 and C5C_5

From papers

Let ers({K3,C5})\mathrm{er}_{s}(\{\overline{K}_3,C_5\}) denote the minimum asymptotic density of ss-cliques among graphs avoiding both K3\overline{K}_3 and C5C_5. Theorem's extension conjecture. The conclusions of the theorem concerning {K3,C5}\{\overline{K}_3,C_5\}, in particular

ers({K3,C5})=21s,\mathrm{er}_{s}(\{\overline{K}_3,C_5\})=2^{1-s},

hold for every s7s\geq 7. The paper does not pursue the proof of this extension; it would remove the stated restriction on ss in the theorem.

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

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).

Solutions 0

No solutions have been posted yet.