Distance Graphs with Large Chromatic Number and without Cliques of Given Size in the Rational Space

作者: Demidovich Y.A.¹^,2
隶属关系:
1. Lomonosov Moscow State University
2. Moscow Institute of Physics and Technology (National Research University)
期: 卷 106, 编号 1-2 (2019)
页面: 38-51
栏目: Article
URL: https://ogarev-online.ru/0001-4346/article/view/151802
DOI: https://doi.org/10.1134/S0001434619070046
ID: 151802

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

We study distance graphs with exponentially large chromatic number which do not contain cliques of prescribed size in the rational space.

distance graph, chromatic number, clique number

Lomonosov Moscow State University; Moscow Institute of Physics and Technology (National Research University)

编辑信件的主要联系方式.
Email: yuradem9595@mail.ru
俄罗斯联邦, Moscow, 119991; Dolgoprudnyi, Moscow Oblast, 141701

附件文件

动作

1. JATS XML