𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs

✍ Scribed by Kühn, Daniela; Osthus, Deryk

Book ID
118198540
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
184 KB
Volume
20
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton paths in Z-transformation graph
Hamilton paths in Z-transformation graphs of perfect matchings of hexagonal systems
✍ Rong-si Chen; Fu-ji Zhang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Let H be a hexagonal system. The Z-transformation graph Z(H) is the graph where the vertices are the perfect matchings of H and where two perfect matchings are joined by an edge provided their symmetric difference is a hexagon of H (Z. Fu-ji et al., 1988). In this paper we prove that Z(H) has a Hami

Random Matchings Which Induce Hamilton C
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs
✍ Jeong Han Kim; Nicholas C. Wormald 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set