A colourful path to matrix-tree theorems
From MaRDI portal
Publication:1985361
Abstract: In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a unified concise proof of variants of this theorem, some known and some new.
Recommendations
Cites work
- scientific article; zbMATH DE number 2174437 (Why is no real title available?)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A combinatorial approach to matrix algebra
- Counting colorful multi-dimensional trees
- Covariant Symanzik identities
- Determinants of Laplacians on graphs
- Directed rooted forests in higher dimension
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Learning about critical phenomena from scribbles and sandpiles
- RANDOM COMPLEXES AND ℓ2-BETTI NUMBERS
- Signed graphs
- Simplicial and cellular trees
- Simplicial matrix-tree theorems
- Spanning forests and the vector bundle Laplacian
Cited in
(3)
This page was built for publication: A colourful path to matrix-tree theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985361)