Around matrix-tree theorem
From MaRDI portal
Abstract: Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system (the classical theorem corresponds to the -case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynomial, are of independent interest.
Recommendations
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- scientific article; zbMATH DE number 1786671
- Matrix-tree theorem of digraphs via signless Laplacians
- Matrix-tree theorems and discrete path integration
- Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
Cited in
(9)- A combinatorial expression for the group inverse of symmetric \(M\)-matrices
- The large N expansion in hyperbolic sigma models
- Matrix-tree theorems and discrete path integration
- scientific article; zbMATH DE number 1786671 (Why is no real title available?)
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- A colourful path to matrix-tree theorems
- On the adjoint of a matrix associated with trees
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- On the Mazur-Tate conjecture for prime conductor and Mazur's Eisenstein ideal
This page was built for publication: Around matrix-tree theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862053)