On a Frankl-Wilson Theorem
- 作者: Sagdeev A.A.1
-
隶属关系:
- Laboratory of Advanced Combinatorics and Network Applications
- 期: 卷 55, 编号 4 (2019)
- 页面: 376-395
- 栏目: Large Systems
- URL: https://journals.rcsi.science/0032-9460/article/view/166647
- DOI: https://doi.org/10.1134/S0032946019040045
- ID: 166647
如何引用文章
详细
We derive an analog of the Frankl-Wilson theorem on independence numbers of some distance graphs. The obtained results are applied to the problem of the chromatic number of a space ℝn with a forbidden equilateral triangle and to the problem of chromatic numbers of distance graphs with large girth.
作者简介
A. Sagdeev
Laboratory of Advanced Combinatorics and Network Applications
编辑信件的主要联系方式.
Email: xp1@protonmail.com
俄罗斯联邦, Moscow
补充文件
