Enumerative properties of ferrers graphs

Richard Ehrenborg, Stephanie Van Willigenburg

Research output: Contribution to journalArticlepeer-review

33 Scopus citations


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.

Original languageEnglish
Pages (from-to)481-492
Number of pages12
JournalDiscrete and Computational Geometry
Issue number4
StatePublished - Nov 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Enumerative properties of ferrers graphs'. Together they form a unique fingerprint.

Cite this