Graphs with large chromatic number induce $3k$-cycles

Marthe Bonamy, Pierre Charbit, Stéphan Thomassé

Answering a question of Kalai and Meshulam, we prove that graphs without induced cycles of length $3k$ have bounded chromatic number. This implies the very first case of a much bro…