Exponentially many Z5-colorings in simple planar graphs
Rikke Langhede, Carsten Thomassen
TL;DR
This paper proves that every simple planar graph with n vertices has an exponential number of Z5-colorings, specifically at least 2^(n/9), highlighting the abundance of such colorings.
Contribution
It establishes a lower bound on the number of Z5-colorings in simple planar graphs, demonstrating exponential growth with respect to the number of vertices.
Findings
Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.
The result shows an exponential lower bound on the number of colorings.
This advances understanding of graph colorings in planar graphs.
Abstract
Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems