Maximum spread of vertex degrees in a simple graph

We consider the following problem: let $n>k$ --- positive integers, $G$ --- a graph on $n$ vertices (undirected, without loops or multiple edges). Let $h_k(G)$ denote the number of unordered pairs of vertices of the graph $G$ whose degrees differ by less than $k$. We seek to determine the smallest p