Tutte's 3-Flow Conjecture states that every 2-edge-connected graph with no 3-cuts admits a 3-flow. The 3-Flow Conjecture is equivalent to the following: let G be a 2-edge-connected graph, let S be a set of at most three vertices of G; if every 3-cut of G separates S then G has a 3-flow. We show that minimum counterexamples to the latter statement are 3-connected, cyclically 4-connected, and cyclically 7-edge-connected.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.