On Graph Continued Fractions and the Heilmann-Lieb Theorem
Combinatorics
2020-04-27 v1
Abstract
Inspired by Viennot's observation that matching polynomials are numerators of branched continued fractions we present a proof of the Heilmann-Lieb Theorem.
Cite
@article{arxiv.2004.11505,
title = {On Graph Continued Fractions and the Heilmann-Lieb Theorem},
author = {Thomás Jung Spier},
journal= {arXiv preprint arXiv:2004.11505},
year = {2020}
}
Comments
3 pages, 2 figures