Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem

DOI10.1016/J.JCTB.2024.06.005zbMATH Open1548.05179MaRDI QIDQ6615755

Matthew Jenssen, Viresh Patel, Guus Regts

Publication date: 8 October 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

zeroschromatic polynomialmaximum degreebroken circuitforest generating function

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planar triangulations with real chromatic roots arbitrarily close to 4
• On the convergence of cluster expansions for polymer gases
• Zeros of chromatic and flow polynomials of graphs
• A determinant formula for the number of ways of coloring a map.
• Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights
• Evaluations of Tutte polynomials of regular graphs
• Cluster expansion for abstract polymer models. New bounds from an old approach
• Recursive families of graphs
• Random spanning forests and hyperbolic symmetry
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• Spanning forests andOSP(N|2M) -invariantσ-models
• Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
• Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree
• Bounds For The Real Zeros of Chromatic Polynomials
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• A logical expansion in mathematics
• Density of Chromatic Roots in Minor-Closed Graph Families
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• Chromatic Roots are Dense in the Whole Complex Plane
• THE GOLDEN RATIO IN THE THEORY OF CHROMATIC POLYNOMIALS.
• Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
• Chromatic Polynomials
• Foundations of the chromatic polynomial
• Most transient random walks have infinitely many cut times
• On the location of chromatic zeros of series-parallel graphs
• Percolation transition for random forests in \(d \geqslant 3\)

This page was built for publication: Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615755)