✦ LIBER ✦

Perfect Matchings andK43-Tilings in Hypergraphs of Large Codegree

✍ Scribed by Oleg Pikhurko

Book ID: 106047731
Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 204 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0787-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings in hypergraphs of large minimu

Matchings in hypergraphs of large minimum degree

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract It is well known that every bipartite graph with vertex classes of size __n__ whose minimum degree is at least __n__/2 contains a perfect matching. We prove an analog of this result for hypergraphs. We also prove several related results that guarantee the existence of almost perfect mat

Combinatorics of perfect matchings in pl

Combinatorics of perfect matchings in plane bipartite graphs and application to tilings

✍ J.C. Fournier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 737 KB

Let G be a plane bipartite graph which admits a perfect matching and with distinguished faces called holes. Let MG denote the perfect matchings graph: its vertices are the perfect matchings of G, two of them being joined by an edge, if and only if they di er only on an alternating cycle bounding a f