Lower bounds for the chromatic numbers of distance graphs with large girth

Authors: Sagdeev A.A.¹
Affiliations:
1. “Mathematical Notes,” Steklov Mathematical Institute
Issue: Vol 101, No 3-4 (2017)
Pages: 515-528
Section: Article
URL: https://journals.rcsi.science/0001-4346/article/view/150013
DOI: https://doi.org/10.1134/S0001434617030130
ID: 150013

Cite item

Full Text

Open Access

Open Access
Restricted Access

Restricted Access

Access granted
Restricted Access

Restricted Access

Subscription Access

Abstract
About the authors
References
Supplementary files
Statistics

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

About the authors

A. A. Sagdeev

“Mathematical Notes,” Steklov Mathematical Institute

Author for correspondence.
Email: hpsbox@mail.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files

Action

1. JATS XML

Copyright (c) 2017 Pleiades Publishing, Ltd.

TOP