Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The permanent can be interpreted as the number of perfect matchings in bipartite graphs.

Is there a similar graph-theoretic interpretation of the determinant?

share|cite|improve this question
Frank Harary has written an article about this: "Determinants, Permanents and Bipartite graphs" – Timothy Wagner Dec 10 '10 at 3:44
up vote 12 down vote accepted

I'm aware of a few. There is the Lindström-Gessel-Viennot lemma, and there is also the matrix-tree theorem. If $A$ is the adjacency matrix of a finite graph $G$ then $\frac{1}{\det(I - At)}$ describes a kind of "zeta function" of $G$. I describe some of how this works in this blog post.

You may also be interested in Kuperberg's An exploration of the permanent-determinant method.

share|cite|improve this answer
A picky remark: the guy's name was Lindström, not Lindstrom. – Hans Lundmark Dec 10 '10 at 7:31
Corrected. Thanks! – Qiaochu Yuan Dec 10 '10 at 7:50
You're welcome! Those dots are a matter of Swedish national pride, you see. ;) – Hans Lundmark Dec 10 '10 at 11:13

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.