Chromatic polynomial

Chromatic polynomial
Thore Husfeldt (talk) · CC BY-SA 4.0 · source
Name	Chromatic polynomial
Field	Graph theory
Introduced	1912
Introduced by	George David Birkhoff
Related	Tutte polynomial, Four Color Theorem, chromatic number

Chromatic polynomial The chromatic polynomial is a function associated with a finite graph that counts the number of proper colorings as a function of the number of available colors. Introduced to approach the Four Color Theorem problem, it connects combinatorial enumeration with algebraic invariants and has influenced research across Cambridge University, Princeton University, Harvard University, University of Oxford, and research groups at the Institute for Advanced Study. Early contributors include George David Birkhoff, W. T. Tutte, and Phillip Hall.

Definition

For a finite simple graph G with vertex set V and edge set E, the chromatic polynomial P_G(k) evaluates the number of ways to assign k distinct colors to V so adjacent vertices receive different colors. The definition was motivated by efforts related to map coloring such as the Four Color Theorem and investigations by mathematicians at institutions like Johns Hopkins University and University of Chicago. Important early developments were reported by George David Birkhoff and later formalized in the work of W. T. Tutte and collaborators at University of Waterloo.

Basic properties

The chromatic polynomial P_G(k) is a monic polynomial of degree |V|, with integer coefficients and alternating sign pattern reflecting inclusion–exclusion principles studied by authors at École Normale Supérieure and University of Cambridge. For a disconnected graph the polynomial factors according to components, a property analyzed in work connected to Felix Klein-era investigations and modern expositions from Massachusetts Institute of Technology and Stanford University. Deletion–contraction relations due to W. T. Tutte yield a recursive identity central to proofs used by researchers at Imperial College London and ETH Zurich. Values at specific integers connect to classical results: P_G(0)=0 for nonempty graphs, P_G(1)=0 if G has any edge, and the evaluation at k equals the number of proper k-colorings, a concept elaborated in lectures at Princeton University and Columbia University.

Computation and algorithms

Exact computation uses the deletion–contraction recurrence attributed to W. T. Tutte and algorithmic frameworks developed by groups at University of Illinois Urbana–Champaign, California Institute of Technology, and University of Toronto. Complexity results link to foundational work by Richard M. Karp and Leslie Valiant; computing coefficients or exact evaluations is #P-hard in general, a hardness classification pursued at Bell Labs and IBM Research. Specialized polynomial-time algorithms exist for trees, series–parallel graphs (studied at University of Bonn) and graphs of bounded treewidth investigated by researchers at Carnegie Mellon University and University of British Columbia. Approximation and randomized algorithms appear in the literature from Microsoft Research and in conferences such as STOC and FOCS.

Connections to graph invariants and algebraic interpretations

The chromatic polynomial relates to the chromatic number χ(G), Tutte polynomial T_G(x,y), flow polynomial and reliability polynomial; these connections were developed in seminal papers by W. T. Tutte and extended at institutions like Rutgers University and University of Waterloo. Algebraic interpretations involve representation theory lines traced to work at Harvard University and Yale University where roots (chromatic roots) are studied in the complex plane, with links to the Beraha numbers investigated by researchers at University of California, Berkeley and University of Minnesota. Connections to matroid theory and the characteristic polynomial of a matroid were expanded by scholars at Cornell University and University of Michigan and tied to combinatorial geometries studied at ETH Zurich.

Examples and notable families of graphs

For trees, P_T(k)=k(k−1)^{n−1}, a formula taught in courses at University of Cambridge and University of Oxford. Complete graphs K_n yield falling factorials k(k−1)...(k−n+1), a classical example appearing in texts from Princeton University Press and Springer. Cycles C_n have polynomial k[(k−1)^{n}+(−1)^n(k−1)], examples used in seminars at Imperial College London and Ecole Polytechnique. Bipartite graphs, planar graphs, chordal graphs and series–parallel graphs each display distinctive polynomial factorizations and root distributions, topics pursued at University of Edinburgh and University of Glasgow. Notable families studied across conferences at SIAM and European Mathematical Society meetings include wheel graphs, complete bipartite graphs, and graphs arising from lattices in statistical mechanics examined by research groups at Princeton University and University of Pennsylvania.

Applications and extensions

Applications arise in statistical physics via the Potts model analyzed at Los Alamos National Laboratory and CERN, network reliability in engineering departments at Georgia Institute of Technology, and algorithmic graph coloring problems in operations research at INSEAD and London School of Economics. Extensions include multivariate generalizations, the chromatic symmetric function developed by Richard P. Stanley at MIT, and connections to knot theory and algebraic geometry explored at California Institute of Technology and Max Planck Institute for Mathematics. Recent research links chromatic polynomials to random graph theory studied at Yahoo Research and to quantum computation motifs discussed at IBM Quantum and Google DeepMind.

Category:Graph theory