Email this article On a Frankl-Wilson Theorem
- Authors: Sagdeev A.A.1
-
Affiliations:
- Laboratory of Advanced Combinatorics and Network Applications
- Issue: Vol 55, No 4 (2019)
- Pages: 376-395
- Section: Large Systems
- URL: https://journal-vniispk.ru/0032-9460/article/view/166647
- DOI: https://doi.org/10.1134/S0032946019040045
- ID: 166647
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. A. Sagdeev
Laboratory of Advanced Combinatorics and Network Applications
Author for correspondence.
Email: xp1@protonmail.com
Russian Federation, Moscow
Supplementary files
