Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations

TL;DR

This paper proves a conjecture relating the mean size of certain spanning subgraphs to acyclic orientations, establishing inequalities for all connected graphs excluding trees and complete graphs.

Contribution

It confirms and strengthens a 2006 conjecture by interpreting coefficients of the chromatic polynomial via acyclic orientations.

Findings

Established inequalities for mean sizes of spanning subgraphs in connected graphs.

Provided a new interpretation of polynomial coefficients through acyclic orientations.

Strengthened understanding of graph coloring and structure through combinatorial proofs.

Abstract

The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components. The parameter $\epsilon(G)=\sum\limits_{i=1}^n (n-i)a_i/\sum\limits_{i=1}^n a_i$ is the mean size of a broken-cycle-free spanning subgraph of $G$. In this article, we confirm and strengthen a conjecture proposed by Lundow and Markstr\"{o}m in 2006 that $\epsilon(T_n)< \epsilon(G)<\epsilon(K_n)$ holds for any connected graph $G$ of order $n$ which is neither the complete graph $K_n$ nor a tree $T_n$ of order $n$. The most crucial step of our proof is to obtain the interpretation of all $a_i$'s by the number of acyclic orientations of $G$.