Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk

DOI10.1002/(SICI)1097-0118(200005)34:1%3C42::AID-JGT5%3E3.0.CO;2-HzbMATH Open0958.05122OpenAlexW4248246025WikidataQ101126724 ScholiaQ101126724MaRDI QIDQ4487074FDOQ4487074

Authors: Béla Bollobás, Colin Cooper, T. I. Fenner, Alan Frieze 

Publication date: 21 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200005)34:1%3C42::aid-jgt5%3E3.0.co;2-h

Recommendations

• Edge-disjoint Hamilton cycles in random graphs
• scientific article; zbMATH DE number 4193709
• Optimal packings of Hamilton cycles in sparse random graphs
• On large matchings and cycles in sparse random graphs
• Random graph's Hamiltonicity is strongly tied to its minimum degree

zbMATH Keywords

random graphsHamilton cycles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

• Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
• On large matchings and cycles in sparse random graphs
• On the threshold for \(k\)-regular subgraphs of random graphs
• Disjoint Hamilton cycles in the random geometric graph
• Hamiltonicity in random graphs is born resilient
• Optimal packings of Hamilton cycles in sparse random graphs
• Cores of random graphs are born Hamiltonian
• Crux and Long Cycles in Graphs
• Edge-disjoint Hamilton cycles in random graphs
• A scaling limit for the length of the longest cycle in a sparse random graph
• On random \(k\)-out subgraphs of large graphs
• Size and connectivity of the \(k\)-core of a random graph
• Graph factors and factorization: 1985--2003: a survey
• Finding Hamilton cycles in sparse random graphs
• On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three

This page was built for publication: Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk

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