✦ LIBER ✦

On Matchings in Groups

✍ Scribed by Jozsef Losonczy

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 125 KB
Volume: 20
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.1998.0587

No coin nor oath required. For personal study only.

✦ Synopsis

A matching property conceived for lattices is examined in the context of an arbitrary Abelian group. The Dyson e-transform and the Cauchy᎐Davenport inequality from additive number theory are used to establish the existence of matchings.

📜 SIMILAR VOLUMES

On induced matchings

✍ Angelika Steger; Min-li Yu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Let q\*(G) denote the minimum integer t for which E(G) can be partitioned into t induced matchings of G. Faudree et al. conjectured that q\*(G)<d2, if G is a bipartite graph and d is the maximum degree of G. In this note, we give an affirmative answer for d=3, the first nontrivial case of this conje

On randomized greedy matchings

✍ Zevi Miller; Dan Pritikin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

where the class ⌬-GRAPHS is the set of graphs of maximum degree at most ⌬ . ᮊ 1997 John ## Ž .

Matchings in Graphs on Non-orientable Su

Matchings in Graphs on Non-orientable Surfaces

✍ Glenn Tesler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to graphs embedding on an arbitrary compact boundaryless 2-manifold S. Kasteleyn stated that perfect matchings in a graph embedding on a surface of genus g could be enumerated as a linear combination of 4 g Pfaff

Counting Matchings in Graphs

✍ E.J. Farrell 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.

Matchings in polytopal graphs

✍ B. Grünbaum 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 667 KB

Transformation from arbitrary matchings

Transformation from arbitrary matchings to stable matchings

✍ Akihisa Tamura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 604 KB