Ramsey properties of random graphs
Journal of Combinatorial Theory Series B
Foundations of positional games
Proceedings of the seventh international conference on Random structures and algorithms
Szemerédi's regularity lemma for sparse graphs
FoCM '97 Selected papers of a conference on Foundations of computational mathematics
Online vertex colorings of random graphs without monochromatic subgraphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online balanced graph avoidance games
European Journal of Combinatorics
Upper bounds for online ramsey games in random graphs
Combinatorics, Probability and Computing
Online ramsey games in random graphs
Combinatorics, Probability and Computing
SIAM Journal on Discrete Mathematics
The online clique avoidance game on random graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Coloring random graphs online without creating monochromatic subgraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
We study the following one-person game against a random graph process: the Player's goal is to $2$-colour a random sequence of edges $e_1,e_2,\dots$ of a complete graph on $n$ vertices, avoiding a monochromatic triangle for as long as possible. The game is over when a monochromatic triangle is created. The online version of the game requires that the Player should colour each edge as it comes, before looking at the next edge.While it is not hard to prove that the expected length of this game is about $n^{4/3}$, the proof of the upper bound suggests the following relaxation: instead of colouring online, the random graph is generated in only two rounds, and the Player colours the edges of the first round before the edges of the second round are thrown in. Given the size of the first round, how many edges can there be in the second round for the Player to be likely to win? In the extreme case, when the first round consists of a random graph with $cn^{3/2}$ edges, where $c$ is a positive constant, we show that the Player can win with high probability only if constantly many edges are generated in the second round.