Small subgraphs in random graphs and the power of multiple choices
Journal of Combinatorial Theory Series B
On balanced coloring games in random graphs
European Journal of Combinatorics
| Hi-index | 0.00 |
In this article, we compare the offline versions of three Ramsey-type one-player games that have been studied in an online setting in previous work: the online Ramsey game, the balanced online Ramsey game, and the Achlioptas game. The goal in all games is to color the edges of the random graph Gn,m according to certain rules without creating a monochromatic copy of some fixed forbidden graph H. Although in general, the three online games have different thresholds, we prove that for most graphs H, the offline threshold for all three problems is m0(n) = n2-1-m2(H), where m2(H) ≔ maxH′⊆H(eH′ - 1)-(vH′ - 2). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2010