How many random edges make a graph Hamiltonian?
type: Item
instance of: scholarly article
title: How many random edges make a graph Hamiltonian?
zbMATH Open document ID: 0521.05056
DOI: 10.1007/BF02579348
author: Eli Shamir
published in: Combinatorica
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 3823845
zbMATH Keywords: threshold edge probability
zbMATH Keywords: Hamiltonian path
Wikidata QID: Q105583337
MaRDI profile type: Publication
cites work: The longest path in a random graph
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Q5657249
cites work: On the strength of connectedness of a random graph
cites work: Q3241504
cites work: Q4144785
cites work: Hamiltonian circuits in random graphs
cites work: On factors in random graphs
cites work: One-factor in random graphs based on vertex choice
cites work: On the existence of Hamiltonian cycles in a class of random graphs
cites work: Limit distribution for the existence of Hamiltonian cycles in a random graph
description: scientific article; zbMATH DE number 3823845