  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.
