Enumeration of paths and cycles and e-coefficients of incomparability graphs
From MaRDI portal
Publication:6206680
arXiv0709.0430MaRDI QIDQ6206680FDOQ6206680
Authors: Gus Wiseman 
Publication date: 4 September 2007
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.
This page was built for publication: Enumeration of paths and cycles and e-coefficients of incomparability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206680)
