Claims

../

1993_01_01_erdos_tuza: Erdős and Tuza (Ann. Discrete Math. 55 (1993)) bound d(n,F) for the triangle, the four-cycle and every forest, which puts these graphs in the answer set; a book chapter with no documented refereeing.

2022_09_28_axenovich_clemen: Axenovich and Clemen (J. Graph Theory 106 (2024)) exclude from the answer set the cliques K_q with q at least 10 and q = 2, 3 mod 4, further graphs with an odd number of edges, and almost all clique sizes; refereed.

2023_03_26_clemen_wagner: Theorem 1.2 of Clemen and Wagner (Electron. J. Combin. 30 (2023)) gives balanced six-colorings of K_{13^k} with no rainbow K_4, so K_4 is outside the answer set; refereed.

2026_09_15_kitamura: A forum claim of 15 September 2026 of a Lean-verified proof of the Axenovich--Clemen conjecture, which puts every clique on at least four vertices outside the answer set; partial, unreviewed and unread here.

---