The first player wins the one-colour triangle avoidance game on 16 vertices
Przemysław Gordinowicz; Paweł Prałat
Discussiones Mathematicae Graph Theory (2012)
- Volume: 32, Issue: 1, page 181-185
- ISSN: 2083-5892
Access Full Article
top
Abstract
topHow to cite
topPrzemysław Gordinowicz, and Paweł Prałat. "The first player wins the one-colour triangle avoidance game on 16 vertices." Discussiones Mathematicae Graph Theory 32.1 (2012): 181-185. <http://eudml.org/doc/270873>.
@article{PrzemysławGordinowicz2012,
abstract = {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.},
author = {Przemysław Gordinowicz, Paweł Prałat},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {triangle avoidance game; combinatorial games},
language = {eng},
number = {1},
pages = {181-185},
title = {The first player wins the one-colour triangle avoidance game on 16 vertices},
url = {http://eudml.org/doc/270873},
volume = {32},
year = {2012},
}
TY - JOUR
AU - Przemysław Gordinowicz
AU - Paweł Prałat
TI - The first player wins the one-colour triangle avoidance game on 16 vertices
JO - Discussiones Mathematicae Graph Theory
PY - 2012
VL - 32
IS - 1
SP - 181
EP - 185
AB - 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.
LA - eng
KW - triangle avoidance game; combinatorial games
UR - http://eudml.org/doc/270873
ER -
References
top- [1] S.C. Cater, F. Harary and R.W. Robinson, One-color triangle avoidance games, Congr. Numer. 153 (2001) 211-221. Zbl0990.91008
- [2] F. Harary, Achievement and avoidance games for graphs, Ann. Discrete Math. 13 (1982) 111-119. Zbl0565.05043
- [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. Zbl1217.91023
- [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. Zbl0528.90109
- [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.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.