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

Binding number and toughness for matching extension

โœ Scribed by Ciping Chen


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
157 KB
Volume
146
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


A graph G of even order is said to be k-extendable if every matching of size k in G can be extended to a 1-factor of G. Plummet (1988) showed that a graph G is k-extendable if tough (G) > k, and we here prove that G is also k-extendable if bind(G) > max {k, (7k + 13)/12}.


๐Ÿ“œ SIMILAR VOLUMES