Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-25T08:58:19.277Z Has data issue: false hasContentIssue false
  • English
  • Français

A Winning Strategy for the Ramsey Graph Game

Published online by Cambridge University Press:  12 September 2008

Aleksandar Pekeč
Aleksandar Pekeč
Affiliation:
Department of Mathematics, Rutgers University New Brunswick, NJ 08903, USA Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a «Maker-Breaker’ version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n − 3)2n−1 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 5 , Issue 3 , September 1996 , pp. 267 - 276
Copyright
Copyright © Cambridge University Press 1996

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]Beck, J. (1993) Combinatorial Games. Lecture Notes, Rutgers University.Google Scholar
[2]Berlekamp, E. R., Conway, J. H. and Guy, R. K. (1982) Winning Ways for your Mathematical Plays. Academic Press.Google Scholar
[3]Beck, J. (1981) Van der Waerden and Ramsey type games. Combinatorica 1 103–116.CrossRefGoogle Scholar
[4]Erdős, P. and Selfridge, J. (1973) On a combinatorial game. J. Comb. Theory A 14 298–301.CrossRefGoogle Scholar