A sharp refinement of a result of Zverovich--Zverovich
Combinatorics
2013-10-16 v1
Abstract
For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequence, its maximal element and its minimal element. In this paper we give a sharp refinement of Zverovich--Zverovich's result.
Keywords
Cite
@article{arxiv.1310.3992,
title = {A sharp refinement of a result of Zverovich--Zverovich},
author = {Grant Cairns and Stacey Mendan and Yuri Nikolayevsky},
journal= {arXiv preprint arXiv:1310.3992},
year = {2013}
}
Comments
7 pages