Hitting forbidden induced subgraphs on bounded treewidth graphs

• Published in: Information and computation Vol. 281; p. 104812
• Main Authors: Sau, Ignasi, dos Santos Souza, Uéverton
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.12.2021; Elsevier
• Subjects: Dynamic programming; Exponential time hypothesis; Hitting subgraphs; Induced subgraphs; Lower bound; Mathematics; Parameterized complexity; Treewidth; Lower bound; Exponential time hypothesis; Induced subgraphs; Hitting subgraphs; Dynamic programming; Parameterized complexity; Treewidth; hitting subgraphs; Exponential Time Hypothesis; induced subgraphs; dynamic programming; lower bound; phrases parameterized complexity; treewidth
• ISSN: 0890-5401; 1090-2651
• DOI: 10.1016/j.ic.2021.104812

For a fixed graph H, the H-IS-Deletion problem asks, given a graph G, for the minimum size of a set S⊆V(G) such that G∖S excludes H as an induced subgraph. We are interested in determining, for a fixed H, the smallest function fH(t) such that H-IS-Deletion can be solved in time fH(t)⋅nO(1) assuming the Exponential Time Hypothesis, where t and n denote the treewidth and the number of vertices of G, respectively. We show that fH(t)=2O(th−2) for every H on h≥3 vertices, and that fH(t)=2O(t) if H is a clique or an independent set. When H deviates slightly from a clique, the function fH(t) suffers a sharp jump: if H is obtained from a clique of size h by removing one edge, then fH(t)=2Θ(th−2). Moreover, fH(t)=2Ω(th) when H=Kh,h, answering a question of Pilipczuk [MFCS 2011].