Twenty Open Problems in Enumeration of Matchings

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 page was built for publication: Twenty Open Problems in Enumeration of Matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500786)