Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds

Frieze, Alan, Gao, Pu, MacRury, Calum, Prałat, Paweł and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2025) Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. European Journal of Combinatorics, 126. ISSN 0195-6698

Text (1-s2.0-S0195669825000046-main) - Published Version Available under License Creative Commons Attribution. Download (680kB)

Abstract

The semi-random graph process is an adaptive random graph process in which an online algorithm is initially presented an empty graph on n vertices. In each round, a vertex u is presented to the algorithm independently and uniformly at random. The algorithm then adaptively selects a vertex v , and adds the edge u v to the graph. For a given graph property, the objective of the algorithm is to force the graph to satisfy this property asymptotically almost surely in as few rounds as possible. We focus on the property of Hamiltonicity. We present an adaptive strategy which creates a Hamiltonian cycle in α n rounds, where α < 1 . 81696 is derived from the solution to a system of differential equations. We also show that achieving Hamiltonicity requires at least β n rounds, where β > 1 . 26575 .

Item Type:	Article
Additional Information:	© 2025 The Author(s)
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	28 Jan 2025 13:21
Last Modified:	29 Jan 2025 14:30
URI:	http://eprints.lse.ac.uk/id/eprint/127094

Actions (login required)

View Item