English

Square of Hamilton cycle in a random graph

Combinatorics 2016-09-20 v3

Abstract

We show that p=enp=\sqrt{\frac{e}{n}} is a sharp threshold for the random graph Gn,pG_{n,p} to contain the square of a Hamilton cycle. This improves the previous results of K\"uhn and Osthus and also Nenadov and \v{S}kori\'c.

Keywords

Cite

@article{arxiv.1606.07833,
  title  = {Square of Hamilton cycle in a random graph},
  author = {Andrzej Dudek and Alan Frieze},
  journal= {arXiv preprint arXiv:1606.07833},
  year   = {2016}
}

Comments

This paper has been withdrawn due to an error in the second moment calculations. We thank Asaf Ferber and Matthew Kwan for drawing our attention to this issue

R2 v1 2026-06-22T14:33:56.734Z