Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs

DOI10.1137/050627010zbMath1117.05071OpenAlexW2072570267MaRDI QIDQ3440255

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

zbMATH Keywords

random graphs

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 (8)

Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Transitive triangle tilings in oriented graphs ⋮ Edge-disjoint Hamilton cycles in graphs ⋮ Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree ⋮ Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs ⋮ Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs ⋮ Edge-disjoint Hamilton cycles in random graphs ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

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