The 2-Factor Polynomial Detects Even Perfect Matchings
Combinatorics
2020-06-02 v2
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 the perfect matching as a subgraph. Consequently, we show that the polynomial detects even perfect matchings.
Keywords
Cite
@article{arxiv.1812.10346,
title = {The 2-Factor Polynomial Detects Even Perfect Matchings},
author = {Scott Baldridge and Adam M. Lowrance and Ben McCarty},
journal= {arXiv preprint arXiv:1812.10346},
year = {2020}
}
Comments
16 pages, 17 figures