Enumeration of paths and cycles and e-coefficients of incomparability graphs
Combinatorics
2007-09-05 v1
Abstract
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in terms of elementary symmetric functions. Analysis of some of the combinatorial implications of this expansion leads to three bijections involving acyclic orientations.
Keywords
Cite
@article{arxiv.0709.0430,
title = {Enumeration of paths and cycles and e-coefficients of incomparability graphs},
author = {Gus Wiseman},
journal= {arXiv preprint arXiv:0709.0430},
year = {2007}
}