Claims

../

1999_04_01_erdos_faudree_rousseau_schelp: Erdős, Faudree, Rousseau and Schelp prove the case s = 2 of Problem 752, that a graph of minimum degree k and girth at least five has order k^2 distinct cycle lengths; Discrete Math. 200 (1999), known through later citations.

2007_07_14_sudakov_verstraete: Sudakov and Verstraëte prove that a graph of average degree d and girth g has order d^floor((g-1)/2) consecutive even cycle lengths, which gives the order k^s distinct cycle lengths Problem 752 asks for; Combinatorica 28 (2008).

---