We isolate two simple infinite determined games on analytic graphs. With their help, we prove that certain large classes of analytic graphs have countable chromatic number.
@article{10_37236_12255,
author = {David Chodounsk\'y and Jind\v{r}ich Zapletal},
title = {Two graph games},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {2},
doi = {10.37236/12255},
zbl = {1543.05134},
url = {http://geodesic.mathdoc.fr/articles/10.37236/12255/}
}
TY - JOUR
AU - David Chodounský
AU - Jindřich Zapletal
TI - Two graph games
JO - The electronic journal of combinatorics
PY - 2024
VL - 31
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/12255/
DO - 10.37236/12255
ID - 10_37236_12255
ER -
%0 Journal Article
%A David Chodounský
%A Jindřich Zapletal
%T Two graph games
%J The electronic journal of combinatorics
%D 2024
%V 31
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/12255/
%R 10.37236/12255
%F 10_37236_12255
David Chodounský; Jindřich Zapletal. Two graph games. The electronic journal of combinatorics, Tome 31 (2024) no. 2. doi: 10.37236/12255