The 2-Factor Polynomial Detects Even Perfect Matchings

  • Scott Baldridge
  • Adam M. Lowrance
  • Ben McCarty
DOI: https://doi.org/10.37236/9214

Abstract

In this paper, we prove that the $2$-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of $2$-factors that contain the perfect matching as a subgraph. Consequently, we show that the polynomial detects even perfect matchings.  

Published
2020-05-29
Issue
Volume 27, Issue 2 (2020)
Article Number
P2.27