On graphs with a large chromatic number containing no small odd cycles

Sergey L. Berlov, Ilya I. Bogdanov

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.