Regular subgraphs of dense graphs (Q1078194)

Main theorem: Every graph on n vertices with at least \(C_ Kn\) log n edges contains a k-regular subgraph. A short proof of this theorem is given based on an ingenous lemma of \textit{N. Alon, S. Friedland} and \textit{G. Kalai} [J. Comb. Theory., Ser. B 37, 79-91 (1984; Zbl 0527.05059)]. The result has been conjectured by Erdős and Sauer.