23 pages, 2 figures, 3 references addedWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially due to Moon for which we provide a new proof, extends the ``all minors'' matrix-tree theorem to the ``massive'' case where no condition on row or column sums is imposed. The second generalization, which is new, extends the recently discovered Pfaffian-tree theorem of Masbaum and Vaintrob into a ``Hyperpfaffian-cactus'' theorem. Our methods are noninductive, explicit and make critical use of Grassmann-Berezin calculus that was developed for the needs of modern theoretical physics
A half-tree is an edge configuration whose superimposition with a perfect match-ing is a tree. In th...
34 pages, 10 figuresA half-tree is an edge configuration whose superimposition with a perfect matchi...
Revtex4, 4 pages. Version 2 (published in PRL) makes slight improvements in the expositionWe prove a...
AbstractWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially...
AbstractWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially...
The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The h...
International audienceIn this short note, we revisit Zeilberger's proof of the classical matrix-tree...
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in ...
AbstractThe Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minor...
ABSTRACT. The All Minors Matrix Tree Theorem states that the determinant of any sub-matrix of a matr...
Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of...
We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of combinatorial...
In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a un...
Revtex4, 4 pages. Version 2 (published in PRL) makes slight improvements in the expositionWe prove a...
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given gr...
A half-tree is an edge configuration whose superimposition with a perfect match-ing is a tree. In th...
34 pages, 10 figuresA half-tree is an edge configuration whose superimposition with a perfect matchi...
Revtex4, 4 pages. Version 2 (published in PRL) makes slight improvements in the expositionWe prove a...
AbstractWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially...
AbstractWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially...
The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The h...
International audienceIn this short note, we revisit Zeilberger's proof of the classical matrix-tree...
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in ...
AbstractThe Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minor...
ABSTRACT. The All Minors Matrix Tree Theorem states that the determinant of any sub-matrix of a matr...
Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of...
We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of combinatorial...
In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a un...
Revtex4, 4 pages. Version 2 (published in PRL) makes slight improvements in the expositionWe prove a...
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given gr...
A half-tree is an edge configuration whose superimposition with a perfect match-ing is a tree. In th...
34 pages, 10 figuresA half-tree is an edge configuration whose superimposition with a perfect matchi...
Revtex4, 4 pages. Version 2 (published in PRL) makes slight improvements in the expositionWe prove a...