Mathematics — Graph Theory · chromatic-polynomial-coefficients
Problem
Let G be a multigraph. Let χG be its chromatic polynomial. For each i∈N, let ai be the coefficient of xi in χG. Prove that a1 is odd if and only if the graph G is connected and has a proper 2-coloring.