The first player wins the one-colour triangle avoidance game on 16 vertices

• Autorzy: Przemysław Gordinowicz , Paweł Prałat
• Języki publikacji: EN

Abstrakty

EN

We consider the one-colour triangle avoidance game. Using a high performance computing network, we showed that the first player can win the game on 16 vertices.

Słowa kluczowe

EN

triangle avoidance game; combinatorial games

Kategorie tematyczne

• 05C35: Extremal problems
• 05C57: Games on graphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2012
• Tom: 32
• Numer: 1
• Strony: 181-185

Daty

wydano

2012

otrzymano

2010-12-08

poprawiono

2011-03-07

zaakceptowano

2011-03-08

Twórcy

autor

Przemysław Gordinowicz

• Institute of Mathematics, Technical University of Lodz, Łódź, Poland

autor

Paweł Prałat

• Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA

Bibliografia

• [1] S.C. Cater, F. Harary and R.W. Robinson, One-color triangle avoidance games, Congr. Numer. 153 (2001) 211-221.
• [2] F. Harary, Achievement and avoidance games for graphs, Ann. Discrete Math. 13 (1982) 111-119.
• [3] B.D. McKay, nauty Users Guide (Version 2.4), http://cs.anu.edu.au/~bdm/nauty/.
• [4] B.D. McKay, personal communication.
• [5] P. Prałat, A note on the one-colour avoidance game on graphs, J. Combin. Math. and Combin. Comp. 75 (2010) 85-94.
• [6] Á. Seress, On Hajnal's triangle-free game, Graphs and Combin. 8 (1992) 75-79, doi: 10.1007/BF01271710.
• [7] D. Singmaster, Almost all partizan games are first person and almost all impartial games are maximal, J. Combin. Inform. System Sci. 7 (1982) 270-274.
• [8] A UNIX script and programs written in C/C++ used to solve the problem, http://www.math.wvu.edu/~pralat/index.php?page=publications.

Identyfikatory

DOI

10.7151/dmgt.1596