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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have