Claims

../

1977_01_01_edwards: Edwards's unpublished 1977 manuscript proves the n/6 book bound, credited by the site and by Bollobás and Nikiforov as an independent proof and by Erdős as a proof of the conjecture; accepted on the site's curator's credit, the proof itself never published.

1979_10_01_khadzhiivanov_nikiforov: Khadzhiivanov and Nikiforov (C. R. Acad. Bulgare Sci. 1979) prove that every graph with n vertices and more than n^2/4 edges has an edge on at least n/6 triangles; accepted on the 1988 reproof, Fox and Loh, and the site's credit.

2004_05_05_bollobas_nikiforov: Corollary 3 of Bollobás and Nikiforov, Books in graphs (European J. Combin. 2005), gives every graph with n vertices and more than n^2/4 edges a book of size greater than n/6; accepted on the refereed publication.

---