Abstract
We prove that, in several settings, a graph has exponentially many nowhere-zero flows. Our results may be seen as a counting alternative to the well-known proofs of existence of Z3-, Z4-, and Z6-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
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
