Claims

../

1952_01_01_dirac: Dirac (Proc. London Math. Soc. 1952) proves that a graph on n >= 3 vertices with minimum degree at least n/2 has a Hamiltonian cycle, which gives the case r = 2 through a perfect matching; refereed, site-credited.

1963_09_01_corradi_hajnal: Corrádi and Hajnal (Acta Math. Acad. Sci. Hungar. 1963) prove that a graph on at least 3k vertices with minimum degree at least 2k has k disjoint cycles, which at 3m vertices gives the case r = 3; refereed, site-credited.

1970_01_01_hajnal_szemeredi: Hajnal and Szemerédi (1970) prove Erdős's conjecture that every graph with rm vertices and minimum degree at least m(r−1) has m disjoint copies of K_r; accepted on the site's credit and Kierstead and Kostochka's refereed reproof.

2008_03_01_kierstead_kostochka: Kierstead and Kostochka (Combin. Probab. Comput. 2008) give a short proof of the Hajnal–Szemerédi theorem, whose clique form is Problem 914; refereed, credited by the site, and formalized in an unbuilt external Lean file.

2010_03_01_kierstead_kostochka_mydlarz_szemeredi: Theorem 1 of Kierstead, Kostochka, Mydlarz and Szemerédi (Combinatorica 2010) restates the Hajnal–Szemerédi theorem and proves it algorithmically; the refereed text behind the problem's standing.

---