Planar triangulations with real chromatic roots arbitrarily close to 4
From MaRDI portal
Publication:941623
Abstract: We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.
Recommendations
Cited in
(11)- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
- The number of colorings of planar graphs with no separating triangles
- Density of Chromatic Roots in Minor-Closed Graph Families
- Chromatic bounds on orbital chromatic roots
- Is the five-flow conjecture almost false?
- Chromatic Roots are Dense in the Whole Complex Plane
- scientific article; zbMATH DE number 7593849 (Why is no real title available?)
- A derivation of an affine plane of order 4 from a triangle-free 3-colored \(K_{16}\)
- Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
- A little statistical mechanics for the graph theorist
This page was built for publication: Planar triangulations with real chromatic roots arbitrarily close to 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941623)