Abstract
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.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Ehrenborg, R., van Willigenburg, S. Enumerative Properties of Ferrers Graphs. Discrete Comput Geom 32, 481–492 (2004). https://doi.org/10.1007/s00454-004-1135-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-004-1135-1