A sharp Dirac-Erdős type bound for large graphs

Henry A. Kierstead, Alexandr V. Kostochka, Andrew McConvey

Let $k\ge 3$ be an integer, $h_k(G)$ be the number of vertices of degree at least $2k$ in a graph $G$, and ${\ell }_k(G)$ be the number of vertices of degree at most $2k-2$ in $…