A sufficient condition for a pair of sequences to be bipartite graphic
Combinatorics
2019-02-20 v1
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.
Keywords
Cite
@article{arxiv.1512.02404,
title = {A sufficient condition for a pair of sequences to be bipartite graphic},
author = {Grant Cairns and Stacey Mendan and Yuri Nikolayevsky},
journal= {arXiv preprint arXiv:1512.02404},
year = {2019}
}
Comments
5 pages