Smaller subgraphs of minimum degree k

Frank Mousset, Andreas Noever, Nemanja Škorić

In 1990 Erdős, Faudree, Rousseau and Schelp proved that for $k\ge 2$, every graph with $n\ge k+1$ vertices and $(k-1)(n-k+2)+\left(\genfrac{}{}{0ex}{}{k-2}{2}\right)+1$ edges contains a subgraph of minimu…