Claims

../

2017_05_28_sauermann: Sauermann's Theorem 1.3 (J. Combin. Theory Ser. B 2019) gives, for k at least 3, a subgraph of minimum degree at least k on at most (1 - 1/(10^4 k^3)) n vertices one edge above the threshold; refereed and credited by the site.

---