Affiliation:
1. Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada
2. Department of Mathematical and Computational Sciences University of Toronto Mississauga Mississauga Ontario Canada
Abstract
AbstractIn 1972, Tutte posed the 3‐Flow Conjecture: that all 4‐edge‐connected graphs have a nowhere‐zero 3‐flow. This was extended by Jaeger et al. to allow vertices to have a prescribed, possibly nonzero difference (modulo 3) between the inflow and outflow. They conjectured that all 5‐edge‐connected graphs with a prescription function have a nowhere‐zero 3‐flow meeting that prescription. Kochol showed that replacing 4‐edge‐connected with 5‐edge‐connected would suffice to prove the 3‐Flow Conjecture and Lovász et al. showed that both conjectures hold if the edge connectivity condition is relaxed to 6‐edge‐connected. Both problems are still open for 5‐edge‐connected graphs. The 3‐Flow Conjecture was known to hold for planar graphs, as it is the dual of Grötzsch's Colouring Theorem. Steinberg and Younger provided the first direct proof using flows for planar graphs, as well as a proof for projective planar graphs. Richter et al. provided the first direct proof using flows of the Strong 3‐Flow Conjecture for planar graphs. We prove the Strong 3‐Flow Conjecture for projective planar graphs.
Funder
Natural Sciences and Engineering Research Council of Canada
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference13 articles.
1. J. A.BondyandU. S. R.Murty Graph theory with applications. MacMillan Press Ltd. London 1976.
2. J.deJong Jaeger's Strong 3‐Flow Conjecture for Graphs in Low Genus Surfaces. PhD thesis University of Waterloo 2020.
3. Two strong 3‐flow theorems for planar graphs;Jong J. V.;J. Comb.,2022
4. R.Diestel Graph theory 3rd ed. vol. 173 Graduate Texts in Mathematics. Springer‐Verlag Berlin Heidelberg 2005.
5. Z.DvořákandB.Mohar On density ofZ3${{\mathbb{Z}}}_{3}$‐flow‐critical graphs Arxiv preprint 2205.07498.2022.https://arxiv.org/abs/2205.07498