|
|||||
|
|
Enumerative Properties of Ferrers Graphs |
|
| Authors: | |
| Institution: | (1) Department of Mathematics, University of Kentucky, Lexington, KY 40506-0027, USA;(2) Department of Mathematics, University of British Columbia, 1984 Mathematics Road, Vancouver, British Columbia, V6T 1Z2, Canada |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |