Online balanced graph avoidance games

@article{Marciniszyn2007OnlineBG,
  title={Online balanced graph avoidance games},
  author={Martin Marciniszyn and Dieter Mitsche and Milos Stojakovic},
  journal={Eur. J. Comb.},
  year={2007},
  volume={28},
  pages={2248-2263}
}
We introduce and study online balanced coloring 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 introduced two at the time, in a random order. For each pair of edges, Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid creating a monochromatic copy of a small fixed graph F for as long as possible. We show that the duration… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Positional games on random graphs

Random Struct. Algorithms • 2005
View 1 Excerpt

Combinatorics, graph theory and computing

József Beck
Ramsey games. Discrete Math., • 2002
View 2 Excerpts

Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics

Béla Bollobás
2001

Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization

Svante Janson, Tomasz Luczak, Andrzej Rucinski
2000
View 1 Excerpt

Deterministic graph games and a probabilistic intuition [ MR1285685 (95h:90191)

József Beck
1997
View 1 Excerpt

Similar Papers

Loading similar papers…