Complementary Graphs with Flows Less Than Three
Combinatorics
2019-03-15 v1
Abstract
X. Hou, H.-J. Lai, P. Li and C.-Q. Zhang [J. Graph Theory 69 (2012) 464-470] showed that for a simple graph with , if , then either or its complementary graph has a nowhere-zero -flow. In this paper, we improve this result by showing that if and , then either or has flow index strictly less than . Our result is proved by a newly developed closure operation and contraction method.
Cite
@article{arxiv.1903.05809,
title = {Complementary Graphs with Flows Less Than Three},
author = {Jiaao Li and Xueliang Li and Meiling Wang},
journal= {arXiv preprint arXiv:1903.05809},
year = {2019}
}
Comments
16 pages, 4 figures