In this article we present a new version of the Erdős-Gallai theorem concerning graphicness of the degree sequences. The best conditions of all known on the reduction of the number of Erdős-Gallai inequalities are given. Moreover, we prove a criterion of the bipartite graphicness and give a sufficient condition for a sequence to be graphic which does not require checking of any Erdős-Gallai inequality.
