On two Hamilton cycle problems in random graphs
type: Item
instance of: scholarly article
title: On two Hamilton cycle problems in random graphs
zbMATH Open document ID: 1145.05049
author: Michael Krivelevich
author: Alan Frieze
published in: Israel Journal of Mathematics
publication date: 2008-10-16T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5351781
zbMATH Keywords: number of edge disjoint Hamilton cycles
zbMATH Keywords: random graph
zbMATH Keywords: removing edges without destroying Hamiltonicity
MaRDI profile type: Publication
full work available at URL: s11856-008-1028-8
OpenAlex ID: W2016267660
Wikidata QID: Q57401483
cites work: Q3698835
cites work: How many random edges make a dense graph hamiltonian?
cites work: Q3344024
cites work: Q3720644
cites work: On the existence of Hamiltonian cycles in a class of random graphs
cites work: On packing Hamilton cycles in \(\varepsilon\)-regular graphs
cites work: Limit distribution for the existence of Hamiltonian cycles in a random graph
cites work: Hamiltonian circuits in random graphs
cites work: Local resilience of graphs
DOI: 10.1007/S11856-008-1028-8
Recommended article: On the number of hamilton cycles in a random graph
Recommended article: Q3816114
Recommended article: Q4729826
Recommended article: Q3720644
Recommended article: Hamiltonian cycles in random regular graphs
Recommended article: Q3975004
Recommended article: On the Number of Hamilton Cycles in Sparse Random Graphs
Recommended article: Q4500692
Recommended article: Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
description: scientific article; zbMATH DE number 5351781