Claims

../

1981_08_01_bollobas_thomason: Bollobás and Thomason (J. Combin. Theory Ser. B 1981) prove that a graph with at least the Turán number of edges is the Turán graph or has a linear-degree vertex with a dense neighborhood; refereed, named by the site, cited by Bondy.

1983_02_01_bondy: Bondy (J. Combin. Theory Ser. B 1983) proves that above the Turán number of edges every maximum-degree vertex has a dense neighborhood; partial, since graphs with exactly the Turán number are outside its hypothesis; refereed.

---