Claims

../

1978_01_01_edwards: Edwards (Bolyai 18, 1978; Bull. London Math. Soc. 1977) proves the conjecture for r from 2 to 8 with n at least r^2, and for every r when m exceeds (r-1)n^2/2r; the results as Bollobás and Nikiforov state them.

1992_09_01_faudree: Faudree (J. Graph Theory 1992) proves the Bollobás–Erdős conjecture for every r at least 2 when n exceeds r^2(r-1)/4; the paper is unread, the range as Bollobás and Nikiforov and the site's commentary state it.

2004_10_08_bollobas_nikiforov: Theorem 2 of Bollobás and Nikiforov (Electron. J. Combin. 2005) proves the Bollobás–Erdős conjecture for n at least r, an r-clique of degree sum at least 2rm/n; accepted on the refereed publication and the site's credit.

---