The following pages link to (Q4547979):
Displaying 16 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Matrix-tree theorems and discrete path integration (Q472420) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- The weighted complexity and the determinant functions of graphs (Q975601) (← links)
- Milnor numbers, spanning trees, and the Alexander-Conway polynomial. (Q1421392) (← links)
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems (Q1739195) (← links)
- The Grassmann-Berezin calculus and theorems of the matrix-tree type (Q1883393) (← links)
- Phase transition in the spanning-hyperforest model on complete hypergraphs (Q1960117) (← links)
- On the Tutte-Krushkal-Renardy polynomial for cell complexes (Q2434893) (← links)
- Principal minors Pfaffian half-tree theorem (Q2439565) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- Simplicial matrix-tree theorems (Q3642704) (← links)
- Generalized loop‐erased random walks and approximate reachability (Q5409862) (← links)
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)
- (Q5882604) (← links)
- Generating functions and counting formulas for spanning trees and forests in hypergraphs (Q6153615) (← links)
