Discrete & Computational Geometry

, Volume 32, Issue 4, pp 481–492

Enumerative Properties of Ferrers Graphs


DOI: 10.1007/s00454-004-1135-1

Cite this article as:
Ehrenborg, R. & van Willigenburg, S. Discrete Comput Geom (2004) 32: 481. doi:10.1007/s00454-004-1135-1


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.

Copyright information

© Springer 2004

Authors and Affiliations

  1. 1.Department of Mathematics, University of Kentucky, Lexington, KY 40506-0027USA
  2. 2.Department of Mathematics, University of British Columbia, 1984 Mathematics Road, Vancouver, British Columbia, V6T 1Z2Canada