Coloring random graphs online without creating monochromatic subgraphs

DOI10.1002/RSA.20445zbMATH Open1296.05077arXiv1103.5849OpenAlexW2163914211MaRDI QIDQ5495876FDOQ5495876

Authors: Torsten Mütze, Thomas Rast, Reto Spöhel

Publication date: 7 August 2014

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Abstract: Consider the following random process: The vertices of a binomial random graph

G_{n, p}

are revealed one by one, and at each step only the edges induced by the already revealed vertices are visible. Our goal is to assign to each vertex one from a fixed number

r

of available colors immediately and irrevocably without creating a monochromatic copy of some fixed graph

F

in the process. Our first main result is that for any

F

and

r

, the threshold function for this problem is given by

p_{0} (F, r, n) = n^{- 1 / m_{1}^{*} (F, r)}

, where

m_{1}^{*} (F, r)

denotes the so-called emph{online vertex-Ramsey density} of

F

and

r

. This parameter is defined via a purely deterministic two-player game, in which the random process is replaced by an adversary that is subject to certain restrictions inherited from the random setting. Our second main result states that for any