Maximum spread of vertex degrees in a simple graph

Abstract

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 possible value $f(n,k)$ of $h_k(G)$. The interest in this question is motivated by the fact that the bipartite analogue of the problem allowed S. Cichomski and F. Petrov \cite{CP} to prove the Burdzy--Pitman conjecture on the spread of independent identically distributed random variables.