Enumerative properties of Ferrers graphs

Details Enumerative properties of Ferrers graphs Enumerative properties of Ferrers graphs

2007-06-20

arxiv.org/abs/0706.2918v1

Discrete Comput. Geom. 32:481--492 (2004), volume in honour of LJ Billera

Mathematics

Combinatorics

12 pages

Scientific paper

We define a class of bipartite graphs that correspond naturally with Ferrers
diagrams. We give expressions for the number of spanning trees, the number of
Hamiltonian paths when applicable, the chromatic polynomial, and the chromatic
symmetric function. We show that the linear coefficient of the chromatic
polynomial is given by the excedance set statistic.

Affiliated with

Also associated with

No associations

Rating

Enumerative properties of Ferrers 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 Enumerative properties of Ferrers graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerative properties of Ferrers graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-34059