Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

Marthe Bonamy, Édouard Bonnet, Hugues Déprés +5

A graph is ${\mathcal{O}}_k$-free if it does not contain $k$ pairwise vertex-disjoint and non-adjacent cycles. We prove that "sparse" (here, not containing large complete bipartite g…