Geodesic
Winning strong games through fast strategies for weak games
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that, for sufficiently large $n$, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.
DOI : 10.37236/631
Classification : 05C57, 05C45, 05C70, 91A43 
@article{10_37236_631,
     author = {Asaf Ferber and Dan Hefetz},
     title = {Winning strong games through fast strategies for weak games},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/631},
     zbl = {1222.05187},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/631/}
}
TY  - JOUR
AU  - Asaf Ferber
AU  - Dan Hefetz
TI  - Winning strong games through fast strategies for weak games
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/631/
DO  - 10.37236/631
ID  - 10_37236_631
ER  - 
%0 Journal Article
%A Asaf Ferber
%A Dan Hefetz
%T Winning strong games through fast strategies for weak games
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/631/
%R 10.37236/631
%F 10_37236_631
Asaf Ferber; Dan Hefetz. Winning strong games through fast strategies for weak games. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/631

Cité par Sources :