Twenty Open Problems in Enumeration of Matchings
classification
🧮 math.CO
keywords
enumerationmatchingsopenproblemsbeendocumentmathtwenty
read the original abstract
This document is an exposition of an assortment of open problems arising from the exact enumeration of (perfect) matchings of finite graphs. Roughly half have been solved at the time of this writing; see the document "Twenty Open Problems in Enumeration of Matchings: Progress Report" (also available from this server as math.CO/9801061). NOTE: This article has now been superseded by math.CO/9904150.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.