Nowhere-zero $3$-flow of graphs with small independence number
Combinatorics
2017-07-24 v1
Abstract
Tutte's -flow conjecture states that every -edge-connected graph admits a nowhere-zero -flow. In this paper, we characterize all graphs with independence number at most that admit a nowhere-zero -flow. The characterization of -flow verifies Tutte's -flow conjecture for graphs with independence number at most and with order at least . In addition, we prove that every odd--edge-connected graph with independence number at most admits a nowhere-zero -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