Online balanced graph avoidance games

European Journal of Combinatorics

Volumn 28, Issue 8, 2007, Pages 2248-2263

  Marciniszyn, Martin ^a   Mitsche, Dieter ^a   Stojaković, Miloš ^a,b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35148818705     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.04.004     Document Type: Article

References (13)

1. József Beck, Deterministic graph games and a probabilistic intuition (MR1285685 (95h:90191)) 1997, pp. 81-94
2. Beck J. Positional games and the second moment method (Paul Erdo{double acute}s and his mathematics). Combinatorica 22 2 (2002) 169-216 (special issue)
3. Beck J. Ramsey games. Combinatorics, Graph Theory and Computing (Louisville, KY, 1999). Discrete Math. 249 1-3 (2002) 3-30
4. Bollobás B. Threshold functions for small subgraphs. Math. Proc. Cambridge Philos. Soc. 90 2 (1981) 197-206
5. Bollobás B. Random Graphs. second ed. Cambridge Studies in Advanced Mathematics vol. 73 (2001), Cambridge University Press, Cambridge
6. Erdo{double acute}s P., and Rényi A. On random graphs. I. Publ. Math. Debrecen 6 (1959) 290-297
7. Friedgut E., Kohayakawa Y., Rödl V., Ruciński A., and Tetali P. Ramsey games against a one-armed bandit (Ramsey theory). Combin. Probab. Comput. 12 5-6 (2003) 515-545 (special issue)
8. Janson S., Luczak T., and Rucinski A. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization (2000), Wiley-Interscience, New York
9. Marciniszyn M., Spöhel R., and Steger A. The online clique avoidance game on random graphs. Approximation, Randomization, and Combinatorial Optimization. Lecture Notes in Comput. Sci. vol. 3624 (2005), Springer, Berlin 390-401
10. Ramsey F.P. On a problem of formal logic. Proc. London Math. Soc. 30 (1930) 264-286
11. Rödl V., and Ruciński A. Threshold functions for Ramsey properties. J. Amer. Math. Soc. 8 4 (1995) 917-942
12. Stojaković M., and Szabó T. Positional games on random graphs. Random Structures Algorithms 26 1-2 (2005) 204-223
13. Vu V.H. A large deviation result on the number of small subgraphs of a random graph. Combin. Probab. Comput. 10 1 (2001) 79-94