Affiliation:
1. Graduate School of Business Columbia University New York New York USA
2. Department of Mathematics University of California San Diego California USA
Abstract
AbstractThe ‐process is a single player game in which the player is initially presented the empty graph on vertices. In each step, a subset of edges is independently sampled according to a distribution . The player then selects one edge from , and adds to its current graph. For a fixed monotone increasing graph property , the objective of the player is to force the graph to satisfy in as few steps as possible. The ‐process generalizes both the Achlioptas process and the semi‐random graph process. We prove a sufficient condition for the existence of a sharp threshold for in the ‐process. Using this condition, in the semi‐random process we prove the existence of a sharp threshold when corresponds to being Hamiltonian or to containing a perfect matching. This resolves two of the open questions proposed by Ben‐Eliezer et al. (RSA, 2020).
Funder
National Science Foundation of Sri Lanka
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Reference17 articles.
1. M.Bayati D.Gamarnik andP.Tetali.Combinatorial approach to the interpolation method and scaling limits in sparse random graphs Proceedings of the Forty‐Second ACM Symposium on Theory of Computing.2010105–114.
2. N. C.Behague T. G.Marbach P.Pralat andA.Rucinski.Subgraph games in the semi‐random graph process and its generalization to hypergraphs. arXiv preprint arXiv:2105.070342021.
3. Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
4. Semi‐random graph process