A sharp refinement of a result of Alon, BenShimon and Krivelevich on bipartite graph vertex sequences
Abstract
We give a sharp refinement of a result of Alon, BenShimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree list of both parts of a bipartite graph. The condition depends only on the length of the sequence and its largest and smallest elements.
 Publication:

arXiv eprints
 Pub Date:
 March 2014
 arXiv:
 arXiv:1403.6307
 Bibcode:
 2014arXiv1403.6307C
 Keywords:

 Mathematics  Combinatorics;
 05C07
 EPrint:
 9 pages