The number of spanning trees of the Bruhat graph

DOI10.1016/J.AAM.2020.102150zbMATH Open1461.05110OpenAlexW3119369337MaRDI QIDQ2020012FDOQ2020012

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorics of Coxeter Groups
• Algebraic Combinatorics

Cited In (10)

• 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
• Matrix-tree theorem of digraphs via signless Laplacians
• Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• On two conjectures concerning spanning tree edge dependences of graphs
• The number of spanning trees in \(K_n\)-complement of a bipartite graph
• Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
• Counting spanning trees with a Kekulé structure in linear hexagonal chains
• The bridge number of arborescent links with many twigs

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

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