A winning strategy for the Ramsey graph game
Publication
, Journal Article
Pekeč, A
Published in: Combinatorics Probability and Computing
January 1, 1996
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. Copyright ©1996 Cambridge University Press.
Duke Scholars
Published In
Combinatorics Probability and Computing
DOI
ISSN
0963-5483
Publication Date
January 1, 1996
Volume
5
Issue
3
Start / End Page
267 / 276
Related Subject Headings
- Computation Theory & Mathematics
- 08 Information and Computing Sciences
- 01 Mathematical Sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Pekeč, A. (1996). A winning strategy for the Ramsey graph game. Combinatorics Probability and Computing, 5(3), 267–276. https://doi.org/10.1017/S0963548300002030
Pekeč, A. “A winning strategy for the Ramsey graph game.” Combinatorics Probability and Computing 5, no. 3 (January 1, 1996): 267–76. https://doi.org/10.1017/S0963548300002030.
Pekeč A. A winning strategy for the Ramsey graph game. Combinatorics Probability and Computing. 1996 Jan 1;5(3):267–76.
Pekeč, A. “A winning strategy for the Ramsey graph game.” Combinatorics Probability and Computing, vol. 5, no. 3, Jan. 1996, pp. 267–76. Scopus, doi:10.1017/S0963548300002030.
Pekeč A. A winning strategy for the Ramsey graph game. Combinatorics Probability and Computing. 1996 Jan 1;5(3):267–276.
Published In
Combinatorics Probability and Computing
DOI
ISSN
0963-5483
Publication Date
January 1, 1996
Volume
5
Issue
3
Start / End Page
267 / 276
Related Subject Headings
- Computation Theory & Mathematics
- 08 Information and Computing Sciences
- 01 Mathematical Sciences