Advertisement

On two theorems of positional games

  • József BeckEmail author
Article
  • 2 Downloads

Abstract

I give fully detailed proofs of two important theorems—the exact solution of the weak clique game and the compactness theorem—in the theory of positional games. Both results were published several years ago, including an outline of the proofs that explained the basic idea, but left some technical details to the reader. Unfortunately, in both cases these details turned out to be highly non-trivial. Several mathematicians asked me for help; asked me to clarify the missing details. This is why I felt obliged to write this paper.

Keywords

Positional games Weight function strategy Hypergraphs Ultrafilter 

Notes

References

  1. 1.
    M. Ajtai, L. Csirmaz, Z. Nagy, On the generalization of the game Go-Moku. Stud. Sci. Math. Hung. 14, 209–226 (1979)MathSciNetzbMATHGoogle Scholar
  2. 2.
    J. Beck, On positional games. J. Comb. Theory Ser. A 30, 117–133 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    J. Beck, Van der Waerden and Ramsey type games. Combinatorica 2, 103–116 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    J. Beck, Positional games and the second moment method. Combinatorica 22(2), 169–216 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    J. Beck, Combinatorial Games, Tic-Tac-Toe Theory (Cambridge University Press, Cambridge, 2008)CrossRefzbMATHGoogle Scholar
  6. 6.
    J. Beck, L. Csirmaz, Variations on a game. J. Comb. Theory Ser. A 33, 297–315 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    P. Erdős, J. Selfridge, On a combinatorial game. J. Comb. Theory Ser. A 14, 298–301 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    D. König, Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta Sci. Math. 3(2–3), 121–130 (1927) (in German) Google Scholar

Copyright information

© Akadémiai Kiadó, Budapest, Hungary 2019

Authors and Affiliations

  1. 1.Rutgers UniversityNew BrunswickUSA

Personalised recommendations