๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Enumerative Properties of Ferrers Graphs

โœ Scribed by Richard Ehrenborg; Stephanie van Willigenburg

Publisher
Springer
Year
2004
Tongue
English
Weight
158 KB
Volume
32
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Enumerative applications of a decomposit
Enumerative applications of a decomposition for graphs and digraphs
โœ Ira M. Gessel ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 650 KB

A simple decomposition for graphs yields generating functions for counting graphs by edges and connected components. A change of variables gives a new interpretation to the Tutte polynomial of the complete graph involving inversions of trees. The relation between the Tutte polynomial of the complete

Enumerative and Combinatorial Properties
Enumerative and Combinatorial Properties of Dyck Partitions
โœ Francesco Brenti ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB

The purpose of this paper is to study the combinatorial and enumerative properties of a new class of (skew) integer partitions. This class is closely related to Dyck paths and plays a fundamental role in the computation of certain Kazhdan-Lusztig polynomials of the symmetric group related to Young's

Intersection properties of graphs
Intersection properties of graphs
โœ Terry A. McKee ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 550 KB

McKee, T.A., Intersection properties of graphs, Discrete Mathematics 89 (1991) 253-260. For each graph-theoretic property, we define a corresponding 'intersection property', motivated by the natural relationship of paths with interval graphs, and of trees with chordal graphs. We then develop a simp