Combinatorica
Ramsey properties of random graphs
Journal of Combinatorial Theory Series B
Ramsey Games Against a One-Armed Bandit
Combinatorics, Probability and Computing
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Online vertex colorings of random graphs without monochromatic subgraphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Upper bounds for online ramsey games in random graphs
Combinatorics, Probability and Computing
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
Upper bounds for online ramsey games in random graphs
Combinatorics, Probability and Computing
Small subgraphs in random graphs and the power of multiple choices
Journal of Combinatorial Theory Series B
Coloring random graphs online without creating monochromatic subgraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On balanced coloring games in random graphs
European Journal of Combinatorics
| Hi-index | 0.00 |
Consider the following one-player game. Starting with the empty graph on n vertices, in every step a new edge is drawn uniformly at random and inserted into the current graph. This edge has to be coloured immediately with one of r available colours. The player's goal is to avoid creating a monochromatic copy of some fixed graph F for as long as possible. We prove a lower bound of nβ(F,r) on the typical duration of this game, where β(F,r) is a function that is strictly increasing in r and satisfies limr→∞ β(F,r) = 2 − 1/m2(F), where n2−1/m2(F) is the threshold of the corresponding offline colouring problem.