Games on Graphs

  • Miloš StojakovićEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8577)


Positional Games is a branch of Combinatorics which focuses on a variety of two player games, ranging from well-known games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs. The field has experienced quite a growth in recent years, with more than a few applications in related areas.

We aim to introduce the basic notions, approaches and tools, as well as to survey the recent developments, open problems and promising research directions, keeping the main focus on the games played on graphs.


positional game Maker-Breaker Avoider-Enforcer probabilistic intuition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Beck, J.: Combinatorial Games: Tic-Tac-Toe Theory. Encyclopedia of Mathematics and Its Applications, vol. 114. Cambridge University Press (2008)Google Scholar
  2. 2.
    Bednarska, M., Luczak, T.: Biased positional games for which random strategies are nearly optimal. Combinatorica 20, 477–488 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Ben-Shimon, S., Ferber, A., Hefetz, D., Krivelevich, M.: Hitting time results for Maker-Breaker games. Random Structures and Algorithms 41, 23–46 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Chvátal, V., Erdős, P.: Biased positional games. Annals of Discrete Mathematics 2, 221–228 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Gale, D.: The game of Hex and the Brouwer fixed-point theorem. The American Mathematical Monthly 86, 818–827 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Gebauer, H., Szabó, T.: Asymptotic random graph intuition for the biased connectivity game. Random Structures and Algorithms 35, 431–443 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Hefetz, D., Krivelevich, M., Szabó, T.: Avoider-Enforcer games. Journal of Combinatorial Theory Series A 114, 840–853 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Structures and Algorithms 34, 112–122 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: Avoider-Enforcer: The rules of the Game. Journal of Combinatorial Theory Series A 117, 152–163 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: Positional Games. Ober- wolfach Seminars, vol. 44. Birkhäuser (2014)Google Scholar
  11. 11.
    Krivelevich, M.: The critical bias for the Hamiltonicity game is (1 + o(1))n/ ln n. Journal of the American Mathematical Society 24, 125–131 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Krivelevich, M., Szabó, T.: Biased positional games and small hypergraphs with large covers. Electronic Journal of Combinatorics 15, R70 (2008)Google Scholar
  13. 13.
    Lehman, A.: A solution of the Shannon switching game. Journal of the Society for Industrial and Applied Mathematics 12, 687–725 (1964)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Müller, T., Stojaković, M.: A threshold for the Maker-Breaker clique game. Random Structures and Algorithms (to appear)Google Scholar
  15. 15.
    Stojaković, M.: Games on Graphs, PhD Thesis. ETH Zürich (2005)Google Scholar
  16. 16.
    Stojaković, M., Szabó, T.: Positional games on random graphs. Random Structures and Algorithms 26, 204–223 (2005)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Mathematics and InformaticsUniversity of Novi SadNovi SadSerbia

Personalised recommendations