Enumerative properties of Ferrers graphs
From MaRDI portal
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
(42)- Explicit expressions for the extremal excedance set statistics
- EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
- On main eigenvalues of chain graphs
- A bijection for the Boolean numbers of Ferrers graphs
- Counting spanning trees in almost complete multipartite graphs
- File placements, fractional matchings, and normal ordering
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- Spanning tree enumeration and nearly triangular graph Laplacians
- Algorithmic techniques for finding resistance distances on structured graphs
- Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes
- On the homogenized linial arrangement: intersection lattice and Genocchi numbers
- 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
- Linear algebraic techniques for weighted spanning tree enumeration
- Combinatorial properties of Farey graphs
- Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
- Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes
- Ferrers graphs, D-permutations, and surjective staircases
- The \(e\)-positivity of two classes of cycle-chord graphs
- Boolean complexes for Ferrers graphs
- Monomial and toric ideals associated to Ferrers graphs
- Simplicial matrix-tree theorems
- The excedance algebra
- scientific article; zbMATH DE number 824697 (Why is no real title available?)
- Linear algebraic techniques for spanning tree enumeration
- The homogenized linial arrangement and Genocchi numbers
- Parallelogram polyominoes and rectangular EW-tableaux: correspondences through the sandpile model
- Combinatorial properties of poly-Bernoulli relatives
- Recursion formulas for poly-Bernoulli numbers and their applications
- scientific article; zbMATH DE number 7771742 (Why is no real title available?)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Interview with Einar Steingrímsson
- Chain graph sequences and Laplacian spectra of chain graphs
- On inverse symmetric division deg index of graphs
- Resistance distances in generalized join graphs
- Around the number of trees in distance-hereditary graphs
- Counting spanning trees with one perfect matching in helicene polygonal chains on the plane and cylinder
- Capacity bounds on integral flows and the Kostant partition function
- Simplicial effective resistance and enumeration of spanning trees
- On bipartite graphs with the minimum number of spanning trees
- The number of spanning trees in \(K_{m , n}\)-complements of bipartite graphs
- Chromatic bases for symmetric functions
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)
