English

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 GG with V(G)44|V(G)|\ge 44, if min{δ(G),δ(Gc)}4\min\{\delta(G),\delta(G^c)\}\ge 4, then either GG or its complementary graph GcG^c has a nowhere-zero 33-flow. In this paper, we improve this result by showing that if V(G)32|V(G)|\ge 32 and min{δ(G),δ(Gc)}4\min\{\delta(G),\delta(G^c)\}\ge 4, then either GG or GcG^c has flow index strictly less than 33. Our result is proved by a newly developed closure operation and contraction method.

Keywords

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

R2 v1 2026-06-23T08:07:40.582Z