Balanced Avoidance Games on Random Graphs - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Balanced Avoidance Games on Random Graphs


We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with $n$ vertices are revealed two at a time in a random order. In each move, Painter immediately and irrevocably decides on a balanced coloring of the new edge pair: either the first edge is colored red and the second one blue or vice versa. His goal is to avoid a monochromatic copy of a given fixed graph $H$ in both colors for as long as possible. The game ends as soon as the first monochromatic copy of $H$ has appeared. We show that the duration of the game is determined by a threshold function $m_H = m_H(n)$. More precisely, Painter will asymptotically almost surely (a.a.s.) lose the game after $m = \omega (m_H)$ edge pairs in the process. On the other hand, there is an essentially optimal strategy, that is, if the game lasts for $m = o(m_H)$ moves, then Painter will a.a.s. successfully avoid monochromatic copies of H using this strategy. Our attempt is to determine the threshold function for certain graph-theoretic structures, e.g., cycles.
Fichier principal
Vignette du fichier
dmAE0164.pdf (147.21 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-01184443 , version 1 (14-08-2015)



Martin Marciniszyn, Dieter Mitsche, Miloš Stojaković. Balanced Avoidance Games on Random Graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.329-334, ⟨10.46298/dmtcs.3454⟩. ⟨hal-01184443⟩


110 View
495 Download



Gmail Mastodon Facebook X LinkedIn More