Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

by   Marthe Bonamy, et al.

A graph is O_k-free if it does not contain k pairwise vertex-disjoint and non-adjacent cycles. We show that Maximum Independent Set and 3-Coloring in O_k-free graphs can be solved in quasi-polynomial time. As a main technical result, we establish that "sparse" (here, not containing large complete bipartite graphs as subgraphs) O_k-free graphs have treewidth (even, feedback vertex set number) at most logarithmic in the number of vertices. This is proven sharp as there is an infinite family of O_2-free graphs without K_3,3-subgraph and whose treewidth is (at least) logarithmic. Other consequences include that most of the central NP-complete problems (such as Maximum Independent Set, Minimum Vertex Cover, Minimum Dominating Set, Minimum Coloring) can be solved in polynomial time in sparse O_k-free graphs, and that deciding the O_k-freeness of sparse graphs is polynomial time solvable.


page 1

page 2

page 3

page 4


Induced subgraphs of bounded treewidth and the container method

A hole in a graph is an induced cycle of length at least 4. A hole is lo...

Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective

We consider the classical problems (Edge) Steiner Tree and Vertex Steine...

On Efficient Domination for Some Classes of H-Free Bipartite Graphs

A vertex set D in a finite undirected graph G is an efficient dominatin...

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

A graph is H-free if it contains no induced subgraph isomorphic to H. We...

Vertex arboricity of cographs

Arboricity is a graph parameter akin to chromatic number, in that it see...

Fair packing of independent sets

In this work we add a graph theoretical perspective to a classical probl...

(Theta, triangle)-free and (even hole, K_4)-free graphs. Part 1 : Layered wheels

We present a construction called layered wheel. Layered wheels are graph...