On a Frankl-Wilson Theorem
- Autores: Sagdeev A.A.1
-
Afiliações:
- Laboratory of Advanced Combinatorics and Network Applications
- Edição: Volume 55, Nº 4 (2019)
- Páginas: 376-395
- Seção: Large Systems
- URL: https://journal-vniispk.ru/0032-9460/article/view/166647
- DOI: https://doi.org/10.1134/S0032946019040045
- ID: 166647
Citar
Resumo
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.
Palavras-chave
Sobre autores
A. Sagdeev
Laboratory of Advanced Combinatorics and Network Applications
Autor responsável pela correspondência
Email: xp1@protonmail.com
Rússia, Moscow
Arquivos suplementares
