Smallest counterexample to the 5-flow conjecture has girth at least eleven

Authors:
Martin Kochol
Affiliations:
MÚ SAV, Štefánikova 49, 814 73 Bratislava 1, Slovakia
Venue:
Journal of Combinatorial Theory Series B
Year:
2010

Citing 7
Cited 1

Topological graph theory

Topological graph theory
Snarks without small cycles

Journal of Combinatorial Theory Series B
A cyclically 6-edge-connected snark of order 118

Discrete Mathematics
Superposition and constructions of graphs without nowhere-zero k-flows

European Journal of Combinatorics
Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks

Journal of Combinatorial Theory Series B
Decomposition formulas for the flow polynomial

European Journal of Combinatorics
Restrictions On Smallest Counterexamples To The 5-Flow Conjecture

Combinatorica

Matrix reduction in a combinatorial computation

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The famous 5-flow conjecture of Tutte is that every bridgeless graph has a nowhere-zero 5-flow. We show that a smallest counterexample to this conjecture must have girth at least eleven.