Rainbow matchings and Hamilton cycles in random graphs

DOI10.1002/rsa.20594zbMath1338.05209DBLPjournals/rsa/BalF16arXiv1311.6423OpenAlexW1937563492WikidataQ57401406 ScholiaQ57401406MaRDI QIDQ2811161

Deepak Bal, Alan M. Frieze

Publication date: 10 June 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6423

zbMATH Keywords

perfect matchingsrandom hypergraphsrainbow coloringsLatin transversal

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (12)

Colorful Hamilton Cycles in Random Graphs ⋮ Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ On rainbow Hamilton cycles in random hypergraphs ⋮ A note on rainbow matchings in strongly edge-colored graphs ⋮ Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors ⋮ Rainbow trees in uniformly edge‐colored graphs ⋮ Multitrees in random graphs ⋮ The threshold for the full perfect matching color profile in a random coloring of random graphs ⋮ Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs ⋮ Rainbow Arborescence in Random Digraphs ⋮ Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs ⋮ Pattern Colored Hamilton Cycles in Random Graphs

Cites Work

• Lopsided Lovász Local lemma and Latin transversals
• Loose Hamilton cycles in random 3-uniform hypergraphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Rainbow Hamilton cycles in random regular graphs
• Factors in random graphs
• Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting
• Rainbow hamilton cycles in random graphs

This page was built for publication: Rainbow matchings and Hamilton cycles in random graphs