Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows

Abstract

We prove that, in several settings, a graph has exponentially many nowhere-zero flows. These results may be seen as a counting alternative to the well-known proofs of existence of ℤ3-, ℤ4-, and ℤ6-flows. In the dual setting, proving exponential number of 3-colorings of planar triangle-free graphs is a related open question due to Thomassen.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    A. Asadi, Z. Dvořák, L. Postle and R. Thomas: Sub-exponentially many 3- colorings of triangle-free planar graphs, J. Combin. Theory Ser. B103 (2013), 706–712.

    MathSciNet  Article  Google Scholar 

  2. [2]

    M. C. Cai: The number of vertices of degree k in a minimally k-edge-connected graph, J. Combin. Theory Ser. B58, (1993), 225–239.

    MathSciNet  Article  Google Scholar 

  3. [3]

    Z. Dvořák, B. Mohar and R. šámal: Exponentially many nowhere-zero ℤ3-, ℤ4, and ℤ6-flows, Electr. Notes in Discr. Math.61, (2017), 375–381.

    Article  Google Scholar 

  4. [4]

    L. Esperet, F. Kardoš, A. D. King, D. Král and S. Norine: Exponentially many perfect matchings in cubic graphs, Adv. Math.227, (2011), 1646–1664.

    MathSciNet  Article  Google Scholar 

  5. [5]

    F. Jaeger: Flows and generalized coloring theorems in graphs, J. Combin. Theory Ser. B26, (1979), 205–216.

    MathSciNet  Article  Google Scholar 

  6. [6]

    L. M. Lovász, C. Thomassen, Y. Wu and C. Zhang: Nowhere-zero 3-flows and modulo k-orientations, J. Comb. Theory, Ser. B103, (2013), 587–598.

    MathSciNet  Article  Google Scholar 

  7. [7]

    W. Mader: Minimale n-fach kantenzusammenhängende Graphen, Math. Ann.191, (1971), 21–28.

    MathSciNet  Article  Google Scholar 

  8. [8]

    W. Mader: Kantendisjunkte Wege in Graphen, Monatsh. Math.78, (1974), 395–404.

    MathSciNet  Article  Google Scholar 

  9. [9]

    W. Mader: A reduction method for edge-connectivity in graphs, Annals of Discrete Mathematics3, (1978), 145–164.

    MathSciNet  Article  Google Scholar 

  10. [10]

    P. D. Seymour: Nowhere-zero 6-flows, J. Combin. Theory Ser. B30, (1981), 130–135.

    MathSciNet  Article  Google Scholar 

  11. [11]

    C. Thomassen: Many 3-colorings of triangle-free planar graphs, J. Combin. Theory Ser. B97, (2007), 334–349.

    MathSciNet  Article  Google Scholar 

  12. [12]

    C. Thomassen: The weak 3-flow conjecture and the weak circular flow conjecture, J. Combin. Theory Ser. B102, (2012), 521–529.

    MathSciNet  Article  Google Scholar 

  13. [13]

    W. T. Tutte: A contribution to the theory of chromatic polynomials, Canadian J. Math.6, (1954), 80–91.

    MathSciNet  Article  Google Scholar 

  14. [14]

    W. T. Tutte: On the algebraic theory of graph colorings, J. Combinatorial Theory1, (1966), 15–50.

    MathSciNet  Article  Google Scholar 

Download references

Acknowledgments

The motivation for this research was sparked during the inspiring workshop New Trends in Graph Coloring at BIRS (Banff, Alberta) in 2016. We thank the anonymous referee for suggestions leading to a simplification of the proof of Theorem 4.5 and to an improvement of the bound.

Author information

Affiliations

Authors

Corresponding authors

Correspondence to Zdeněk Dvořák or Bojan Mohar or Robert Šámal.

Additional information

Preliminary version of this work appears as extended abstract from Eurocomb 2017, published as [3].

Supported by project 14-19503S (Graph coloring and structure) of Czech Science Foundation.

Supported in part by the NSERC Discovery Grant R611450 (Canada), by the Canada Research Chairs program, and by the Research Project J1-8130 of ARRS (Slovenia).

Partially supported by grant 16-19910S of the Czech Science Foundation. Partially supported by grant LL1201 ERC CZ of the Czech Ministry of Education, Youth and Sports.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Dvořák, Z., Mohar, B. & Šámal, R. Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. Combinatorica 39, 1237–1253 (2019). https://doi.org/10.1007/s00493-019-3882-x

Download citation

Mathematics Subject Classification (2010)

  • 05C21
  • 05C30