A sufficient condition for a pair of sequences to be bipartite graphic
arXiv:1512.02404 · doi:10.1017/S0004972716000198
Abstract
We present a sufficient condition for a pair of finite integer sequences to be degree sequences of a bipartite graph, based only on the lengths of the sequences and their largest and smallest elements.
5 pages