Hitting minors on bounded treewidth graphs. iv. an optimal algorithm

For a fixed finite collection of graphs F, the F-M-Deletion problem is as follows: given an n-vertex input graph G, find the minimum number of vertices that intersect all minor models in G of the graphs in F. by Courcelle's Theorem, this problem can be solved in time f(F)(tw) center dot n(O(1)), where tw is the treewidth of G for some function f(F) depending on F. In a recent series of articles, we have initiated the program of optimizing asymptotically the function f(F). Here we provide an algorithm showing that f(F) (tw) = 2(O(tw.log tw)) for every collection F. Prior to this work, the best known function f(F) was double-exponential in tw. In particular, our algorithm vastly extends the results of Jansen, Lokshtanov, and Saurabh [Proc. of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2014, pp. 1802-1811] for the particular case F = {K-5, K-3,K-3} and of Kociumaka and Pilipczuk [Algorithmica, 81 (2019), pp. 3655-3691] for graphs of bounded genus, and answers an open problem posed by Cygan et al. [Inform. Comput., 256 (2017), pp. 62-82]. We combine several ingredients such as the machinery of boundaried graphs in dynamic programming via representatives, the Flat Wall Theorem, bidimensionality, the irrelevant vertex technique, treewidth modulators, and protrusion replacement. Together with our previous results providing single-exponential algorithms for particular collections F [J. Baste, I. Sau, and D. M. Thilikos, Theoret. Comput. Sci., 814 (2020), pp. 135-152] and general lower bounds [J. Baste, I. Sau, and D. M. Thilikos, J. Comput. Syst. Sci., 109 (2020), pp. 56-77], our algorithm yields the following complexity dichotomy when F = {H} contains a single connected graph H, assuming the Exponential Time Hypothesis: f(H)(tw) = 2(Theta(tw)) if H is a contraction of the chir or the bammer, and f(H)(tw) = 2(Theta(tw.log tw)) otherwise.