A Note on Divisibility of the Number of Matchings of a Family of Graphs

  • Kyung-Won Hwang
  • Naeem N. Sheikh
  • Stephen G. Hartke
DOI: https://doi.org/10.37236/248

Abstract

For a certain graph obtained by adding extra vertices and edges to the triangular lattice graph, Propp conjectured that the number of perfect matchings of such a graph is always divisible by $3$. In this note we prove this conjecture.

Published
2009-03-20
How to Cite
Hwang, K.-W., Sheikh, N. N., & Hartke, S. G. (2009). A Note on Divisibility of the Number of Matchings of a Family of Graphs. The Electronic Journal of Combinatorics, 16(1), N10. https://doi.org/10.37236/248
Issue
Volume 16, Issue 1 (2009)
Article Number
N10