English

Nowhere-zero $3$-flow of graphs with small independence number

Combinatorics 2017-07-24 v1

Abstract

Tutte's 33-flow conjecture states that every 44-edge-connected graph admits a nowhere-zero 33-flow. In this paper, we characterize all graphs with independence number at most 44 that admit a nowhere-zero 33-flow. The characterization of 33-flow verifies Tutte's 33-flow conjecture for graphs with independence number at most 44 and with order at least 2121. In addition, we prove that every odd-55-edge-connected graph with independence number at most 33 admits a nowhere-zero 33-flow. To obtain these results, we introduce a new reduction method to handle odd wheels.

Keywords

Cite

@article{arxiv.1707.06745,
  title  = {Nowhere-zero $3$-flow of graphs with small independence number},
  author = {Jiaao Li and Rong Luo and Yi Wang},
  journal= {arXiv preprint arXiv:1707.06745},
  year   = {2017}
}

Comments

16 pages,3 figures

R2 v1 2026-06-22T20:53:33.273Z