Enumeration of paths and cycles and e-coefficients of incomparability graphs

Details Enumeration of paths and cycles and e-coefficients of incomparability graphs Enumeration of paths and cycles and e-coefficients of incomparability graphs

2007-09-04

arxiv.org/abs/0709.0430v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Enumeration of paths and cycles and e-coefficients of incomparability graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of paths and cycles and e-coefficients of incomparability graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of paths and cycles and e-coefficients of incomparability graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414620