✦ LIBER ✦

Large matchings in bipartite graphs have a rainbow matching

✍ Scribed by Kotlar, Daniel; Ziv, Ran

Book ID: 121463540
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 612 KB
Volume: 38
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.11.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The rainbow number of matchings in regul

The rainbow number of matchings in regular bipartite graphs

✍ Xueliang Li; Zhixia Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Given a graph G and a subgraph H of G, let rb(G, H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G, H) is called the rainbow number of H with respect to G. Denote as mK 2 a matching of size m and as B n,k the set of all the k-regular

Coloured matchings in bipartite graphs

✍ Kathie Cameron 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A theorem of states that for every n x n (n ~> 3) complete bipartite graph G such that every edge is coloured and each colour is the colour of at most two edges, there is a perfect matching whose edges have distinct colours. We give an O(n 2) algorithm for finding such a perfect matching. We show t

Induced matchings in bipartite graphs

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

Maximum matching in a convex bipartite g

Maximum matching in a convex bipartite graph

✍ Fred Glover 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

Group Weighted Matchings in Bipartite Gr

Group Weighted Matchings in Bipartite Graphs

✍ R. Aharoni; R. Meshulam; B. Wajnryb 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 340 KB