Intersecting 1-factors and nowhere-zero 5-flows (Q519996)

Tutte's famous \(5\)-flow conjecture, which is equivalent to its restriction to cubic graphs, says that every bridgeless graph has a nowhere-zero 5-flow. This paper contains two main results, where \(\mu_2(G)\) is the minimum number \(k\) such that two 1-factors of the graph \(G\) intersect in \(k\) edges: If \(G\) is a cyclically 6-edge-connected cubic graph and \(\mu_2(G) \leq 2\), then \(G\) has a nowhere-zero 5-flow. If \(G\) is a cyclically \(n\)-edge-connected cubic graph and \(n \geq 5\mu_2(G)-3\), then \(G\) has a nowhere-zero 5-flow.