Mat. Zametki, 2017 Volume 101, Issue 3, Pages 430–445
(Mi mzm11149)
|
This article is cited 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.
UDC:
519.1 Received: 26.03.2016
DOI:
10.4213/mzm11149
© , 2024
Fulltext:
PDF file (523 kB)
