most citedAlmost all 5-regular graphs have a 3-flow

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2015★ 1 cited

Almost all 5-regular graphs have a 3-flow

Pawel Pralat, Nick Wormald

Tutte conjectured in 1972 that every 4-edge connected graph has a nowhere-zero 3-flow. This has long been known to be equivalent to the conjecture that every 5-regular 4-edge-conne…