𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rainbow numbers for matchings in plane triangulations

✍ Scribed by Jendrol’, Stanislav; Schiermeyer, Ingo; Tu, Jianhua

Book ID
124121264
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
557 KB
Volume
331
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constrained Ramsey numbers for rainbow m
Constrained Ramsey numbers for rainbow matching
✍ Allan Siu Lun Lo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

The Ramsey number R k (G) of a graph G is the minimum number N, such that any edge coloring of K N with k colors contains a monochromatic copy of G. The constrained Ramsey number f (G, T ) of the graphs G and T is the minimum number N, such that any edge coloring of K N with any number of colors con

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