✦ LIBER ✦

On induced matchings

✍ Scribed by Angelika Steger; Min-li Yu

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 313 KB
Volume: 120
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90590-p

No coin nor oath required. For personal study only.

✦ Synopsis

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 conjecture.

📜 SIMILAR VOLUMES

Induced matchings in bipartite graphs

✍ R.J. Faudree; A. Gyárfas; R.H. Schelp; Zs. Tuza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Induced matchings in cubic graphs

✍ Peter Horák; He Qing; William T. Trotter 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 527 KB

## Abstract In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdös and Nešetřil: For each __d__ ≥ 3, the edge set of a graph of maximum de

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 ## Ž .

On Matchings in Groups

✍ Jozsef Losonczy 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 125 KB

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.

Induced matching extendable graphs

✍ Jinjiang, Yuan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB

We say that a simple graph G is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G. The main results of this paper are as follows: (1) For every connected IM-extendable graph 2 |V (G)| -2; the equality holds if and only if G ∼

Dynamic matchings and quasidynamic fract

Dynamic matchings and quasidynamic fractional matchings. I

✍ James B. Orlin 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 560 KB

## Abstract This paper presents and solves in polynomial time the dynamic matching problem, an integer programming problem which involves matchings in a time‐expanded infinite network. The initial model is a finite directed graph __G__ = (__V, E__) in which each edge has an associated real‐valued w