Skip to main content Accessibility help
×
Home
Hostname: page-component-558cb97cc8-fpk9s Total loading time: 0.285 Render date: 2022-10-07T05:28:08.135Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": true, "useSa": true } hasContentIssue true

Online Ramsey Games in Random Graphs

Published online by Cambridge University Press:  01 March 2009

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)

Abstract

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.

Type
Paper
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Bollobás, B. (1981) Threshold functions for small subgraphs. Math. Proc. Cambridge Philos. Soc. 90 197206.CrossRefGoogle Scholar
[2]Bollobás, B. and Thomason, A. (1987) Threshold functions. Combinatorica 7 3538.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 1924.CrossRefGoogle Scholar
[5]Friedgut, E. (2005) Hunting for sharp thresholds. Random Struct. Alg. 26 3751.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 515545.CrossRefGoogle Scholar
[7]Łuczak, T., Ruciński, A. and Voigt, B. (1992) Ramsey properties of random graphs. J. Combin. Theory Ser. B 56 5568.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.Google 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.Google 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 243249.CrossRefGoogle Scholar
[12]Ramsey, F. P. (1930) On a problem of formal logic. In Proc. London Math. Soc. 30 264286.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 917942.CrossRefGoogle Scholar
16
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Online Ramsey Games in Random Graphs
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Online Ramsey Games in Random Graphs
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Online Ramsey Games in Random Graphs
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *