The number of spanning trees of the Bruhat graph

DOI10.1016/j.aam.2020.102150zbMath1461.05110OpenAlexW3119369337MaRDI QIDQ2020012

Richard Ehrenborg

Publication date: 23 April 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2020.102150

zbMATH Keywords

partitionspanning treeBruhat graphsymmetric group character

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest ⋮ Counting spanning trees in a complete bipartite graph which contain a given spanning forest ⋮ Counting spanning trees with a Kekulé structure in linear hexagonal chains ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Matrix-tree theorem of digraphs via signless Laplacians

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics of Coxeter Groups
• Algebraic Combinatorics

This page was built for publication: The number of spanning trees of the Bruhat graph