Enumerative properties of Ferrers graphs

Simple item page
dc.creatorEhrenborg, Richard
dc.creatorvan Willigenburg, Stephanie
dc.date2007-06-20
dc.date.accessioned2026-07-07T08:11:17Z
dc.date.available2026-07-07T08:11:17Z
dc.descriptionWe 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.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/0706.2918
dc.identifierhttp://arxiv.org/abs/0706.2918
dc.identifierDiscrete Comput. Geom. 32:481--492 (2004), volume in honour of LJ Billera
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132076
dc.subjectCombinatorics
dc.subject05C30
dc.titleEnumerative properties of Ferrers graphs
dc.typetext

Files

Collections

arXiv