Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs

DOI10.1137/050627010zbMATH Open1117.05071OpenAlexW2072570267MaRDI QIDQ3440255FDOQ3440255

Authors: Daniela Kühn, Deryk Osthus 

Publication date: 22 May 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050627010

Recommendations

• Color‐biased Hamilton cycles in random graphs
• Multicoloured Hamilton cycles
• Powers of Hamilton cycles in pseudorandom graphs
• Rainbow Hamilton cycles in randomly colored randomly perturbed dense graphs
• Colorful Hamilton Cycles in Random Graphs

zbMATH Keywords

random graphs

Mathematics Subject Classification ID

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

Cited In (12)

• Coprime networks of the composite numbers: pseudo-randomness and synchronizability
• Tight co-degree condition for packing of loose cycles in 3-graphs
• Powers of Hamilton cycles in pseudorandom graphs
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
• Transitive triangle tilings in oriented graphs
• Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs
• A note on color-bias Hamilton cycles in dense graphs
• Powers of Hamilton cycles in pseudorandom graphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Edge-disjoint Hamilton cycles in random graphs
• Edge-disjoint Hamilton cycles in graphs
• Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs

This page was built for publication: Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440255)