Two graph games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00587138" target="_blank" >RIV/67985840:_____/24:00587138 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.37236/12255" target="_blank" >https://doi.org/10.37236/12255</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.37236/12255" target="_blank" >10.37236/12255</a>
Alternative languages
Result language
angličtina
Original language name
Two graph games
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GX20-31529X" target="_blank" >GX20-31529X: Abstract convergence schemes and their complexities</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Journal of Combinatorics
ISSN
1077-8926
e-ISSN
1077-8926
Volume of the periodical
31
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
P2.44
UT code for WoS article
001246623000001
EID of the result in the Scopus database
2-s2.0-85195986543