|
This article is cited in 10 scientific papers (total in 10 papers)
Large Systems
On a Frankl–Wilson Theorem
A. A. Sagdeev Laboratory of Advanced Combinatorics and Network Applications,
Moscow Institute of Physics and Technology (State University), Moscow, Russia
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 $\mathbb{R}^n$ with a forbidden equilateral triangle and to the problem of chromatic numbers of distance graphs with large girth.
Keywords:
distance graph, Frankl–Wilson theorem, Frankl–Rödl theorem, chromatic number, Euclidean Ramsey theory, girth.
Received: 02.07.2019 Revised: 09.10.2019 Accepted: 12.11.2019
Citation:
A. A. Sagdeev, “On a Frankl–Wilson Theorem”, Probl. Peredachi Inf., 55:4 (2019), 86–106; Problems Inform. Transmission, 55:4 (2019), 376–395
Linking options:
https://www.mathnet.ru/eng/ppi2305 https://www.mathnet.ru/eng/ppi/v55/i4/p86
|
Statistics & downloads: |
Abstract page: | 308 | Full-text PDF : | 33 | References: | 25 | First page: | 16 |
|