Coloring the distance graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F23%3A00574192" target="_blank" >RIV/67985840:_____/23:00574192 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s40879-023-00665-6" target="_blank" >https://doi.org/10.1007/s40879-023-00665-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s40879-023-00665-6" target="_blank" >10.1007/s40879-023-00665-6</a>
Alternative languages
Result language
angličtina
Original language name
Coloring the distance graphs
Original language description
Let n⩾ 1 be a number. Let Γ n be the graph on Rn connecting points of rational Euclidean distance. It is consistent with choiceless set theory ZF+DC that Γ n has countable chromatic number, yet the chromatic number of Γ n+1 is uncountable.
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
2023
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
European Journal of Mathematics
ISSN
2199-675X
e-ISSN
—
Volume of the periodical
9
Issue of the periodical within the volume
3
Country of publishing house
DE - GERMANY
Number of pages
16
Pages from-to
66
UT code for WoS article
001040471100001
EID of the result in the Scopus database
2-s2.0-85165983543