On graphs with a large chromatic number containing no small odd cycles
  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. 
Sergey L. Berlov, Ilya I. Bogdanov
math.CO