Enumerative properties of Ferrers graphs

DOI10.1007/s00454-004-1135-1zbMath1055.05151arXiv0706.2918OpenAlexW2041014877MaRDI QIDQ1764162

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)

Related Items (32)

Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas ⋮ The homogenized Linial arrangement and Genocchi numbers ⋮ EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model ⋮ Spanning tree enumeration and nearly triangular graph Laplacians ⋮ Algorithmic techniques for finding resistance distances on structured graphs ⋮ Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes ⋮ Parallelogram polyominoes and rectangular EW-tableaux: Correspondences through the Sandpile model ⋮ The excedance algebra ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Interview with Einar Steingrímsson ⋮ Chain graph sequences and Laplacian spectra of chain graphs ⋮ Ferrers graphs, D-permutations, and surjective staircases ⋮ On inverse symmetric division deg index of graphs ⋮ Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes ⋮ Chromatic bases for symmetric functions ⋮ The \(e\)-positivity of two classes of cycle-chord graphs ⋮ Unnamed Item ⋮ Combinatorial properties of poly-Bernoulli relatives ⋮ Monomial and toric ideals associated to Ferrers graphs ⋮ Linear Algebraic Techniques for Spanning Tree Enumeration ⋮ On main eigenvalues of chain graphs ⋮ On the homogenized linial arrangement: intersection lattice and Genocchi numbers ⋮ A bijection for the Boolean numbers of Ferrers graphs ⋮ Simplicial matrix-tree theorems ⋮ 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 ⋮ Explicit expressions for the extremal excedance set statistics ⋮ Counting spanning trees in almost complete multipartite graphs ⋮ Linear algebraic techniques for weighted spanning tree enumeration ⋮ File placements, fractional matchings, and normal ordering ⋮ Recursion formulas for poly-Bernoulli numbers and their applications ⋮ The \(e\)-positivity and Schur positivity of some spiders and broom trees

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