Sinks in Acyclic Orientations of Graphs
classification
🧮 math.CO
keywords
acyclicorientationsalgorithmicbijectionchromaticcoefficientfunctionsgive
read the original abstract
Greene and Zaslavsky proved that the number of acyclic orientations of a graph with a unique sink is, up to sign, the linear coefficient of the chromatic polynomial. We give three new proofs of this result using pure induction, noncommutative symmetric functions, and an algorithmic bijection.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.