,
Jakob Greilhuber
,
Tim A. Hartmann
Creative Commons Attribution 4.0 International license
For Vertex Cover, a minimal blocking set of a graph G is an inclusion-wise minimal vertex set contained in no minimum vertex cover of G. Bougeret et al. [SIDMA 2022] showed that, for all minor-closed graph classes 𝒢, Vertex Cover has a polynomial kernel parameterized by the distance to 𝒢 if and only if 𝒢 has bounded minimal blocking sets.
In this work, we explore how far this connection between minimal blocking sets and kernelization extends to ℱ-Minor Deletion parameterized by the deletion distance to 𝒢. For a fixed nonempty finite family ℱ of graphs, given a graph G and integer k, ℱ-Minor Deletion asks whether G can be made free of minors from ℱ by deleting at most k vertices.
A minimal ℱ-blocking set of G is an inclusion-wise minimal vertex set not contained in any optimal ℱ-Minor Deletion solution of G. For families ℱ of connected graphs, we show that if some graph class 𝒢 closed under disjoint union has unbounded minimal ℱ-blocking sets, then ℱ-Minor Deletion parameterized by the deletion distance to 𝒢 has no polynomial kernel. This generalizes a result of Hols et al. [SIDMA 2022] for Vertex Cover.
We then show that this criterion does not capture all kernelization lower bounds for ℱ-Minor Deletion parameterized by the distance to minor-closed graph classes 𝒢. Motivated by the work of Dekker and Jansen [Discrete Appl. Math. 2024], we study the more general notion of extended ℱ-blocking sets. Under additional conditions, we show that 𝒢 having unbounded minimal extended ℱ-blocking sets rules out polynomial kernels.
For every fixed integer η ≥ 1, Pw-η Deletion is the problem of deleting at most k vertices to reduce the pathwidth of a given graph to at most η. We show that it has no polynomial kernel parameterized by the distance to graphs with pathwidth at most η+1. Moreover, for all families ℱ of graphs, each connected and having at least two vertices, we show that ℱ-Minor Deletion parameterized by the distance to graphs with pathwidth at most max_{F ∈ ℱ} pw(F) + 1 has no polynomial kernel. These lower bounds rely in part on a pathwidth analysis of a minor modification of a construction due to Donkers and Jansen [J. Comput. Syst. Sci. 2021].
@InProceedings{ghazy_et_al:LIPIcs.IPEC.2026.19,
author = {Ghazy, Ahmed and Greilhuber, Jakob and Hartmann, Tim A.},
title = {{Exploring Minimal Blocking Sets for Kernelization Lower Bounds for ℱ-Minor Deletion}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.19},
URN = {urn:nbn:de:0030-drops-281927},
doi = {10.4230/LIPIcs.IPEC.2026.19},
annote = {Keywords: Kernelization Lower Bounds, Minimal Blocking Sets, ℱ-Minor Deletion, Pathwidth Deletion}
}