Tutte’s 5-flow conjecture from 1954 states that every bridge- less graph has a nowhere-zero 5-flow. It suffices to prove the conjecture for cyclically 6-edge-connected cubic graphs. We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. This implies that every minimum counterexample to the 5-flow conjecture has oddness at least 6.
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4
Mazzuoccolo, Giuseppe;
2017-01-01
Abstract
Tutte’s 5-flow conjecture from 1954 states that every bridge- less graph has a nowhere-zero 5-flow. It suffices to prove the conjecture for cyclically 6-edge-connected cubic graphs. We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. This implies that every minimum counterexample to the 5-flow conjecture has oddness at least 6.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
18_11_2015_5_Flow_odd_4_revised.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Accesso ristretto
Dimensione
264.84 kB
Formato
Adobe PDF
|
264.84 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
