A sharp refinement of a result of Zverovich–Zverovich.

For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequence, its largest entry and its smallest entry. Barrus, Hartke, Jao, and West gave a better bound and showed that the sharp bound is never less than theirs by more than 1. In this paper we determine the sharp bound. [ABSTRACT FROM AUTHOR]