Balanced online Ramsey games in random graphs

Electronic Journal of Combinatorics

Volumn 16, Issue 1, 2009, Pages

  Prakash, Anupam ^a   Spöhel, Reto ^b   Thomas, Henning ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 59349085586     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/100     Document Type: Article

References (16)

1. D. Achlioptas and E. Friedgut. A sharp threshold for k-colorability. Random Structures & Algorithms, 14(1):63-70, 1999.
2. B. Bollobás. Threshold functions for small subgraphs. Math. Proc. Cambridge Philos. Soc., 90(2):197-206, 1981.
3. R. Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, third edition, 2005.
4. P. Erdos and A. Rényi. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl, 5:17-61, 1960.
5. E. Friedgut, Y. Kohayakawa, V. Rödl, A. Ruciński, and P. Tetali. Ramsey games against a one-armed bandit. Combin. Probab. Comput., 12(5-6):515-545, 2003. Special issue on Ramsey theory.
6. S. Janson. Poisson approximation for large deviations. Random Structures & Algorithms, 1(2):221-229, 1990.
7. M. Krivelevich, P.-S. Loh, and B. Sudakov. Avoiding small subgraphs in Achlioptas processes. Random Structures & Algorithms, 34:165-195, 2009.
8. M. Krivelevich, R. Spöhel, and A. Steger. Offline thresholds for Ramsey-type games on random graphs. Submitted for publication.
9. T. Łuczak, A. Ruciński, and B. Voigt. Ramsey properties of random graphs. J. Combin. Theory Ser. B, 56(1):55-68, 1992.
10. M. Marciniszyn, D. Mitsche, and M. Stojaković. Online balanced graph avoidance games. European J. Combin., 28(8):2248-2263, 2007.
11. M. Marciniszyn and R. Spöhel. Online vertex colorings of random graphs without monochromatic subgraphs. In Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pages 486-493, 2007. Journal version accepted for publication in Combinatorica.
12. M. Marciniszyn, R. Spöhel, and A. Steger. Online Ramsey games in random graphs. Accepted for publication in Combinatorics, Probability and Computing.
13. M. Marciniszyn, R. Spöhel, and A. Steger. Upper bounds for online Ramsey games in random graphs. Accepted for publication in Combinatorics, Probability and Computing.
14. T. Mütze, R. Spöhel, and H. Thomas. Small subgraphs in random graphs and the power of multiple choices. Submitted for publication.
15. V. Rödl and A. Ruciński. Lower bounds on probability thresholds for Ramsey properties. In Combinatorics, Paul Erdos is eighty, Vol. 1, Bolyai Soc. Math. Stud., pages 317-346. János Bolyai Math. Soc., Budapest, 1993.
16. V. Rödl and A. Ruciński. Threshold functions for Ramsey properties. J. Amer. Math. Soc., 8(4):917-942, 1995.