电邮这篇文章 Chromatic Numbers of Distance Graphs with Several Forbidden Distances and without Cliques of a Given Size
- 作者: Berdnikov A.V.1
-
隶属关系:
- Moscow Institute of Physics and Technology (State University)
- 期: 卷 54, 编号 1 (2018)
- 页面: 70-83
- 栏目: Large Systems
- URL: https://bakhtiniada.ru/0032-9460/article/view/166487
- DOI: https://doi.org/10.1134/S0032946018010064
- ID: 166487
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
We consider distance graphs with k forbidden distances in an n-dimensional space with the p-norm that do not contain cliques of a fixed size. Using a probabilistic construction, we present graphs of this kind with chromatic number at least (Bk)Cn, where B and C are constants.
作者简介
A. Berdnikov
Moscow Institute of Physics and Technology (State University)
编辑信件的主要联系方式.
Email: alexey-berdnikov@yandex.ru
俄罗斯联邦, Moscow
补充文件
