Forbidding induced even cycles in a graph: typical structure and counting

Jaehoon Kim, Daniela Kühn, Deryk Osthus +1

We determine, for all $k\ge 6$, the typical structure of graphs that do not contain an induced $2k$-cycle. This verifies a conjecture of Balogh and Butterfield. Surprisingly, the…