Enumerative properties of ferrers graphs

Richard Ehrenborg; Stephanie Van Willigenburg

doi:10.1007/s00454-004-1135-1

Enumerative properties of ferrers graphs

Richard Ehrenborg, Stephanie Van Willigenburg

Mathematics

Research output: Contribution to journal › Article › peer-review

33 Scopus citations

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.

Original language	English
Pages (from-to)	481-492
Number of pages	12
Journal	Discrete and Computational Geometry
Volume	32
Issue number	4
DOIs	https://doi.org/10.1007/s00454-004-1135-1
State	Published - Nov 2004

ASJC Scopus subject areas

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

Access to Document

10.1007/s00454-004-1135-1

Cite this

@article{f6a738803a434b58956436d934f91e73,

title = "Enumerative properties of ferrers graphs",

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.",

author = "Richard Ehrenborg and {Van Willigenburg}, Stephanie",

year = "2004",

month = nov,

doi = "10.1007/s00454-004-1135-1",

language = "English",

volume = "32",

pages = "481--492",

number = "4",

}

TY - JOUR

T1 - Enumerative properties of ferrers graphs

AU - Ehrenborg, Richard

AU - Van Willigenburg, Stephanie

PY - 2004/11

Y1 - 2004/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=12144282710&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=12144282710&partnerID=8YFLogxK

U2 - 10.1007/s00454-004-1135-1

DO - 10.1007/s00454-004-1135-1

M3 - Article

AN - SCOPUS:12144282710

SN - 0179-5376

VL - 32

SP - 481

EP - 492

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 4

ER -

Enumerative properties of ferrers graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this