On graphs with a large chromatic number containing no small odd cycles
Combinatorics
2013-05-06 v1
Abstract
In this paper, we present the lower bounds for the number of vertices in a graph with a large chromatic number containing no small odd cycles.
Keywords
Cite
@article{arxiv.1201.3271,
title = {On graphs with a large chromatic number containing no small odd cycles},
author = {Sergey L. Berlov and Ilya I. Bogdanov},
journal= {arXiv preprint arXiv:1201.3271},
year = {2013}
}