Sinks in Acyclic Orientations of Graphs

Simple item page
dc.creatorGebhard, David D.
dc.creatorSagan, Bruce E.
dc.date1999-07-12
dc.date.accessioned2026-07-07T05:29:53Z
dc.date.available2026-07-07T05:29:53Z
dc.descriptionGreene 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.
dc.description17 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/9907078
dc.identifierhttp://arxiv.org/abs/math/9907078
dc.identifierJ. Combin. Theory (B) 80 (2000) 130-146
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78813
dc.subjectCombinatorics
dc.subject05C20
dc.titleSinks in Acyclic Orientations of Graphs
dc.typetext

Files

Collections

arXiv