scientific article; zbMATH DE number 1786671
From MaRDI portal
Publication:4547979
Recommendations
Cited in
(24)- Simplicial matrix-tree theorems
- Principal minors Pfaffian half-tree theorem
- Generating functions and counting formulas for spanning trees and forests in hypergraphs
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- Spanning trees of 3-uniform hypergraphs
- Trees and acyclic matrices over arbitrary fields
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- scientific article; zbMATH DE number 7664091 (Why is no real title available?)
- Matrix-tree theorems and discrete path integration
- Note on the Pfaffian matrix-tree theorem
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- The Complexity of Acyclic Subhypergraph Problems
- Milnor numbers, spanning trees, and the Alexander-Conway polynomial.
- On ranks of matrices associated with trees
- Generalized loop-erased random walks and approximate reachability
- Around matrix-tree theorem
- scientific article; zbMATH DE number 1048021 (Why is no real title available?)
- An enumerating function for spanning forests with color restrictions
- Phase transition in the spanning-hyperforest model on complete hypergraphs
- On the adjoint of a matrix associated with trees
- On the Tutte-Krushkal-Renardy polynomial for cell complexes
- Almost full rank matrices arising from transitive tournaments
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- The weighted complexity and the determinant functions of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547979)