Induced Cycles and Chromatic Number

Abstract

We prove that, for any pair of integers k, l≥1, there exists an integer N(k, l ) such that every graph with chromatic number at least N(k, l) contains either Kk or an induced odd cycle of length at least 5 or an induced cycle of length at least l. © 1999 Academic Press.