|
This article is cited in 10 scientific papers (total in 10 papers)
Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth
A. Sagdeev
Abstract:
We obtain some specific exponential lower bounds for the chromatic numbers of distance graphs with large girth.
Keywords:
chromatic number, distance graph, Frankl–Rödl theorem.
Received: 26.03.2016
Citation:
A. Sagdeev, “Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth”, Mat. Zametki, 101:3 (2017), 430–445; Math. Notes, 101:3 (2017), 515–528
Linking options:
https://www.mathnet.ru/eng/mzm11149https://doi.org/10.4213/mzm11149 https://www.mathnet.ru/eng/mzm/v101/i3/p430
|
Statistics & downloads: |
Abstract page: | 379 | Full-text PDF : | 44 | References: | 52 | First page: | 21 |
|