arXiv Analytics

Sign in

arXiv:1512.02404 [math.CO]AbstractReferencesReviewsResources

A sufficient condition for a pair of sequences to be bipartite graphic

Grant Cairns, Stacey Mendan, Yuri Nikolayevsky

Published 2015-12-08Version 1

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.

Comments: 5 pages
Categories: math.CO
Subjects: 05C07
Related articles: Most relevant | Search more
arXiv:math/0610787 [math.CO] (Published 2006-10-26, updated 2008-01-10)
Shifted set families, degree sequences, and plethysm
arXiv:1305.5145 [math.CO] (Published 2013-05-22, updated 2013-12-12)
Mirror bipartite graphs
arXiv:1312.1213 [math.CO] (Published 2013-12-04)
Forcing $k$-repetitions in degree sequences

Links

Toolbox