A remark on the Whitney Broken Circuit Theorem

2024/07/04 by Fialho, Paula M. S., Juliano, Emanuel, Procacci, Aldo
#05C31 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2407.04035

Abstract

In the present note we show, via the connection between chromatic polynomial and Potts model, that the Whitney Broken circuit theorem is in fact a special case of a more general identity relating the chromatic polynomial of a graph G=(V,E) to sums over forests of G associated to some partition scheme in G.

Related

• An Abstraction of Whitney's Broken Circuit Theorem
• Generalized Whitney formulas for broken circuits in ambigraphs and matroids
• A Broken Circuit Model for Chromatic Homology Theories
• Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
• An Inductive Proof of Whitney's Broken Circuit Theorem