Enumerative properties of Ferrers graphs

DOI10.1007/S00454-004-1135-1MaRDI QIDQ1764162zbMATH OpenOpenAlexFDO

Authors Richard Ehrenborg, Stephanie van Willigenburg

Publication date 23 February 2005

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0706.2918

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Coloring of graphs and hypergraphs (05C15)

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.

Recommendations

• Graphical Eulerian numbers and chromatic generating functions
• Maximizing spectral radius and number of spanning trees in bipartite graphs
• The use of the chromatic polynomial of a graph in enumerative combinatorics
• scientific article; zbMATH DE number 3920500
• Chromatic polynomials and the symmetric group

Cited in

(36)

• The excedance algebra
• Simplicial matrix-tree theorems
• Linear algebraic techniques for weighted spanning tree enumeration
• Chromatic bases for symmetric functions
• Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
• The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
• The \(e\)-positivity and Schur positivity of some spiders and broom trees
• Counting spanning trees in almost complete multipartite graphs
• Combinatorial properties of Farey graphs
• Explicit expressions for the extremal excedance set statistics
• scientific article; zbMATH DE number 7771742 (Why is no real title available?)
• Boolean complexes for Ferrers graphs
• Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
• EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
• The homogenized linial arrangement and Genocchi numbers
• Chain graph sequences and Laplacian spectra of chain graphs
• On the homogenized linial arrangement: intersection lattice and Genocchi numbers
• scientific article; zbMATH DE number 824697 (Why is no real title available?)
• On inverse symmetric division deg index of graphs
• Recursion formulas for poly-Bernoulli numbers and their applications
• Monomial and toric ideals associated to Ferrers graphs
• Algorithmic techniques for finding resistance distances on structured graphs
• Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes
• On main eigenvalues of chain graphs
• A bijection for the Boolean numbers of Ferrers graphs
• Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes
• Parallelogram polyominoes and rectangular EW-tableaux: correspondences through the sandpile model
• Interview with Einar Steingrímsson
• The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
• Resistance distances in generalized join graphs
• Ferrers graphs, D-permutations, and surjective staircases
• The \(e\)-positivity of two classes of cycle-chord graphs
• Linear algebraic techniques for spanning tree enumeration
• Combinatorial properties of poly-Bernoulli relatives
• Spanning tree enumeration and nearly triangular graph Laplacians
• File placements, fractional matchings, and normal ordering

This page was built for publication: Enumerative properties of Ferrers graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764162)