✦ LIBER ✦

Matching extension and minimum degree

✍ Scribed by N. Ananchuen; L. Caccetta

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 495 KB
Volume: 170
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00352-w

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

Degrees and matchings

✍ V Chvátal; D Hanson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 415 KB

Matchings and matching extensions in gra

Matchings and matching extensions in graphs

✍ Ciping Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let G be a graph with a perfect matching and k be an integer such that l~<k< I V(G)l/2. Then G is said to be k-extendable if every matching of size k in G extends to a perfect matching of G. Plummer (1994) proved that every (2k + 1)-connected K~,s-free graph of even order is k-extendable. In this p

Matching, matroids, and extensions

✍ William H. Cunningham 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Girth, minimum degree, and circumference

✍ M. N. Ellingham; D. K. Menser 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

Mean distance and minimum degree

✍ Kouider, Mekkia; Winkler, Peter 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

We prove that in a graph of order n and minimum degree d, the mean distance µ must satisfy This asymptotically confirms, and improves, a conjecture of the computer program GRAFFITI. The result is close to optimal; examples show that for any d, µ may be larger than n/(d + 1).