Abstract
Tutte conjectured in 1972 that every 4-edge connected graph has a nowhere-zero 3-flow. This is equivalent to every 5-regular 4-edge-connected graph having an edge orientation in which every out-degree is either 1 or 4. We show that this property holds asymptotically almost surely for random 5-regular graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N. Alon, N. Linial, and R. Meshulam, “Additive bases of vector spaces over prime fields”, J. Combinatorial Theory, Ser. A 57 (1991), 203–210.
N. Alon and P. Prałat, “Modular orientations of random and quasi-random regular graphs”, Combinatorics, Probability and Computing 20 (2011), 321–329.
B. Bollobás, “A probabilistic proof of an asymptotic formula for the number of labelled regular graphs”, European Journal of Combinatorics 1 (1980), 311–316.
J.A. Bondy and U.S.R. Murty, “Graph Theory with Applications”, Macmillan, London, 1976.
F. Jaeger, “Nowhere-zero flow problems”, in L. Beineke, et al., editors, “Selected Topics in Graph Theory” 3, Academic Press, London, New York (1988), 91–95.
T.R. Jensen and B. Toft, “Graph coloring problems”, Wiley-Intersci. Ser. Discrete Math. Optim. 1995.
H.J. Lai and C.Q. Zhang, “Nowhere-zero 3-flows of highly connected graphs”, Discrete Math. 110 (1992), 179–183.
L.M. Lovász, C. Thomassen, Y. Wu, and C.Q. Zhang, “Nowhere-zero 3-flows and modulo k-orientations”, Journal of Combinatorial Theory, Series B 103 (2013), 587–598.
R.W. Robinson and N.C. Wormald, “Almost all cubic graphs are hamiltonian”, Random Structures Algorithms 3 (1992), 117–125.
P.D. Seymour, “Nowhere-zero flows”, in “Handbook of Combinatorics” 299, North-Holland, Amsterdam, 1995.
C. Thomassen, “The weak 3-flow conjecture and the weak circular flow conjecture”, Journal of Combinatorial Theory, Series B 102 (2012), 521–529.
N.C. Wormald, “Models of random regular graphs”, Surveys in Combinatorics, 1999, J.D. Lamb and D.A. Preece, editors, London Mathematical Society Lecture Note Series 276 (1999), 239–298.
Acknowledgements
The first author was supported by NSERC. The second one was supported by an ARC Australian Laureate Fellowship.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Prałat, P., Wormald, N. (2017). Almost All 5-Regular Graphs Have a 3-Flow. In: Díaz, J., Kirousis, L., Ortiz-Gracia, L., Serna, M. (eds) Extended Abstracts Summer 2015. Trends in Mathematics(), vol 6. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-51753-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-51753-7_15
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-51752-0
Online ISBN: 978-3-319-51753-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)