A combinatorial mapping for the higher-dimensional matrix-tree theorem
From MaRDI portal
Publication:2680943
Recommendations
Cites work
- scientific article; zbMATH DE number 4680 (Why is no real title available?)
- scientific article; zbMATH DE number 5047784 (Why is no real title available?)
- A family of matrix-tree multijections
- Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
- Chip-Firing and Rotor-Routing on Directed Graphs
- Circuit-cocircuit reversing systems in regular matroids
- Computing the Continuous Discretely
- Critical groups of simplicial complexes
- Cuts and flows of cell complexes
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
- Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
- Matrix tree theorems
- Self-organized criticality
- Simplicial matrix-tree theorems
- Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
Cited in
(3)
This page was built for publication: A combinatorial mapping for the higher-dimensional matrix-tree theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680943)