On graphs with a large chromatic number containing no small odd cycles
arXiv:1201.3271 · doi:10.1007/s10958-012-0882-4
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.