Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T00:39:38.835Z Has data issue: false hasContentIssue false
  • English
  • Français

Online Ramsey Games in Random Graphs

Published online by Cambridge University Press:  01 March 2009

MARTIN MARCINISZYN ,
RETO SPÖHEL  and
ANGELIKA STEGER
MARTIN MARCINISZYN
Affiliation:
Institute of Theoretical Computer Science, ETH Zürich, 8092 Zürich, Switzerland (e-mail: mmarcini@inf.ethz.ch, rspoehel@inf.ethz.ch, steger@inf.ethz.ch)
RETO SPÖHEL
Affiliation:
Institute of Theoretical Computer Science, ETH Zürich, 8092 Zürich, Switzerland (e-mail: mmarcini@inf.ethz.ch, rspoehel@inf.ethz.ch, steger@inf.ethz.ch)
ANGELIKA STEGER
Affiliation:
Institute of Theoretical Computer Science, ETH Zürich, 8092 Zürich, Switzerland (e-mail: mmarcini@inf.ethz.ch, rspoehel@inf.ethz.ch, steger@inf.ethz.ch)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

References

[1]Bollobás, B. (1981) Threshold functions for small subgraphs. Math. Proc. Cambridge Philos. Soc. 90 197–206.CrossRefGoogle Scholar
[2]Bollobás, B. and Thomason, A. (1987) Threshold functions. Combinatorica 7 35–38.CrossRefGoogle Scholar
[3]Diestel, R. (2005) Graph Theory, Vol. 173 of Graduate Texts in Mathematics, 3rd edn, Springer, Berlin.Google Scholar
[4]Folkman, J. (1970) Graphs with monochromatic complete subgraphs in every edge coloring. SIAM J. Appl. Math. 18 19–24.CrossRefGoogle Scholar
[5]Friedgut, E. (2005) Hunting for sharp thresholds. Random Struct. Alg. 26 37–51.CrossRefGoogle Scholar
[6]Friedgut, E., Kohayakawa, Y., Rödl, V., Ruciński, A. and Tetali, P. (2003) Ramsey games against a one-armed bandit. Combin. Probab. Comput. 12 515–545.CrossRefGoogle Scholar
[7]Łuczak, T., Ruciński, A. and Voigt, B. (1992) Ramsey properties of random graphs. J. Combin. Theory Ser. B 56 55–68.CrossRefGoogle Scholar
[8]Marciniszyn, M. and Spöhel, R. (2007) Online vertex colorings of random graphs without monochromatic subgraphs. In Proc. 18th annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 486–493. Journal version to appear in Combinatorica.Google Scholar
[9]Marciniszyn, M., Spöhel, R. and Steger, A. (2005) The online clique avoidance game on random graphs. In Approximation, Randomization and Combinatorial Optimization, Vol. 3624 of Lecture Notes in Computer Science, Springer, pp. 390–401.CrossRefGoogle Scholar
[10]Marciniszyn, M., Spöhel, R. and Steger, A. (2009) Upper bounds for online Ramsey games in random graphs. Combin. Probab. Comput., this issue.CrossRefGoogle Scholar
[11]Nešetřil, J. and Rödl, V. (1976) The Ramsey property for graphs with forbidden complete subgraphs. J. Combin. Theory Ser. B 20 243–249.CrossRefGoogle Scholar
[12]Ramsey, F. P. (1930) On a problem of formal logic. In Proc. London Math. Soc. 30 264–286.CrossRefGoogle Scholar
[13]Rödl, V. and Ruciński, A. (1993) Lower bounds on probability thresholds for Ramsey properties. In Combinatorics: Paul Erdős is Eighty, Vol. 1 of Bolyai Society Mathematical Studies, pp. 317–346.Google Scholar
[14]Rödl, V. and Ruciński, A. (1995) Threshold functions for Ramsey properties. J. Amer. Math. Soc. 8 917–942.CrossRefGoogle Scholar