𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of matchings in random regular graphs and bipartite graphs

✍ Scribed by B Bollobás; B.D McKay

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
475 KB
Volume
41
Category
Article
ISSN
0095-8956

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