We prove that, for any pair of integers k, l greater than or equal to 1, th
ere exists an integer N(k, l) such that every graph with chromatic number a
t least N(k, l) contains either K-k or an induced odd cycle of length at le
ast 5 or an induced cycle of length at least l. (C) 1999 Academic Press.