Around matrix-tree theorem

DOI10.4310/MRL.2006.v13.n5.a7zbMath1109.05067arXivmath/0512164MaRDI QIDQ862053

Yu. M. Burman, Boris Zalmanovich Shapiro

Publication date: 5 February 2007

Published in: Mathematical Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0512164

zbMATH Keywords

Laplacian matrixmultivariate Tutte polynomialsubgraph count

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

On the Mazur-Tate conjecture for prime conductor and Mazur's Eisenstein ideal ⋮ Matrix-tree theorems and discrete path integration ⋮ Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems ⋮ A combinatorial expression for the group inverse of symmetric \(M\)-matrices ⋮ The large N expansion in hyperbolic sigma models

This page was built for publication: Around matrix-tree theorem