79 citations · 209 across the 18 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2009
On the optimality of the Arf invariant formula for graph polynomials
Martin Loebl, Gregor Masbaum
We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalently, the Ising partition function, of a graph.
math.CO2002
Matrix-tree theorems and the Alexander-Conway polynomial
Gregor Masbaum
This talk is a report on joint work with A. Vaintrob [arXiv:math.CO/0109104 and math.GT/0111102]. It is organised as follows. We begin by recalling how the classical Matrix-Tree Th…
math.CO2001★ 4 cited
A New Matrix-Tree Theorem
Gregor Masbaum, Arkady Vaintrob
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case o…