A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process

05/04/2022
by   Pu Gao, et al.
0

The semi-random graph process is a single player game in which the player is initially presented an empty graph on n vertices. In each round, a vertex u is presented to the player independently and uniformly at random. The player then adaptively selects a vertex v, and adds the edge uv to the graph. For a fixed monotone graph property, the objective of the player is to force the graph to satisfy this property with high probability in as few rounds as possible. We focus on the problem of constructing a Hamiltonian cycle in as few rounds as possible. In particular, we present an adaptive strategy for the player which achieves it in α n rounds, where α < 2.01678 is derived from the solution to some system of differential equations. We also show that the player cannot achieve the desired property in less than β n rounds, where β > 1.26575. These results improve the previously best known bounds and, as a result, the gap between the upper and lower bounds is decreased from 1.39162 to 0.75102.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2023

Power of k Choices in the Semi-Random Graph Process

The semi-random graph process is a single player game in which the playe...
research
07/18/2019

Very fast construction of bounded-degree spanning graphs via the semi-random graph process

Semi-random processes involve an adaptive decision-maker, whose goal is ...
research
03/23/2023

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process

The semi-random graph process is a single player game in which the playe...
research
07/29/2022

Sharp Thresholds in Adaptive Random Graph Processes

Suppose that K_n is the complete graph on vertex set [n], and is a dist...
research
02/21/2023

The Swiss Gambit

In each round of a Swiss-system tournament, players of similar score are...
research
05/17/2018

A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time

It is known for some time that a random graph G(n,p) contains w.h.p. a H...
research
10/12/2022

Fast Convergence to Unanimity in Dense Erdős-Rényi Graphs

Majority dynamics on the binomial Erdős-Rényi graph 𝖦(n,p) with p=λ/√(n)...

Please sign up or login with your details

Forgot password? Click here to reset