๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A compactness theorem for perfect matchings in matroids

โœ Scribed by P Komjath; E.C Milner; N Polat

Book ID
107884263
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
558 KB
Volume
44
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A compactness result for perfect matchin
A compactness result for perfect matchings
โœ Norbert Polat ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 537 KB

We show that an infinite set system (V, ~g), for which ~ is a subspace of the vector space of all finite subsets of V, has a perfect matching if and only if every finite subset of V is covered by a matching of (V, ~).

A Complementation Theorem for Perfect Ma
A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion
โœ Mihai Ciucu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 589 KB

A cellular graph is a graph whose edges can be partitioned into 4-cycles (called cells) so that each vertex is contained in at most two cells. We present a ``Complementation Theorem'' for the number of matchings of certain subgraphs of cellular graphs. This generalizes the main result of M. Ciucu (J