Restrictions On Smallest Counterexamples To The 5-Flow Conjecture

Using counting arguments, we show that every smallest counterexample to Tutte’s 5-flow Conjecture (that every bridgeless graph has a nowhere-zero 5-flow) has girth at least 9.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Martin Kochol*.

Additional information

* This work was supported by Science and Technology Assistance Agency under the contract No. APVT-51-027604 and partially by VEGA grant 2/4004/04. The author was also affiliated at the School of Mathematics, Georgia Institute of Technology, the Department of Mathematics, Vanderbilt University.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kochol*, M. Restrictions On Smallest Counterexamples To The 5-Flow Conjecture. Combinatorica 26, 83–89 (2006). https://doi.org/10.1007/s00493-006-0006-1

Download citation

Mathematics Subject Classification (2000):

  • 05C15