Twenty Open Problems in Enumeration of Matchings

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
25 pages

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/76488

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9801060
 http://arxiv.org/abs/math/9801060

Collections

arXiv