The amazing chromatic polynomial

DOI10.1007/s00283-021-10136-zzbMath1518.05090arXiv2106.03647OpenAlexW4206550239MaRDI QIDQ6169806

Bruce E. Sagan

Publication date: 12 July 2023

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.03647

zbMATH Keywords

hyperplane arrangementsacyclic orientationsincreasing forests

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic quasisymmetric functions
• Proper caterpillars are distinguished by their chromatic symmetric function
• Graphs with equal chromatic symmetric functions
• Factoring the characteristic polynomial of a lattice
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Increasing spanning forests in graphs and simplicial complexes
• Hodge theory for combinatorial geometries
• A symmetric function generalization of the chromatic polynomial of a graph
• On distinguishing trees by their chromatic symmetric functions
• Acyclic orientations of graphs
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• Unimodality, log-concavity, real-rootedness and beyond
• Bijective proofs of two broken circuit theorems
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Bijective Proofs of Proper Coloring Theorems
• Combinatorics: The Art of Counting
• An introduction to chromatic polynomials

This page was built for publication: The amazing chromatic polynomial