On two Hamilton cycle problems in random graphs

By Alan M. Frieze, Michael Krivelevich. 2008

79 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/d4b57510ceb1105092023ca6a00f7fdcb0f21772

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. D. Kühn
2. Deryk Osthus
3. Peter Keevash
4. Soroosh Shafieezadeh-Abadeh
5. John C. Duchi
6. Hamed Rahimian
7. Boris Defourny
8. Jikai Zou

Citations in the corpus

• Hamilton cycles in graphs and hypergraphs: an extremal perspective (2014, background): “Frieze & Krivelevich [57] p = (1+o(1)) logn n exact”