Small subgraphs of large minimum degree
In 1991, Erd\H{o}s, Faudree, Rousseau and Schelp asked to estimate the smallest $u=u(n,d,s)$ such that every $n$-vertex graph with average degree at least $d$ has a subgraph on at most $u$ vertices with minimum degree at least $s$. We resolve this problem up to polylogarithmic factors for all even values of $s$. More p...