Journal of Computer and System Sciences ( IF 1.1 ) Pub Date : 2019-12-12 , DOI: 10.1016/j.jcss.2019.11.002 Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
For a finite fixed collection of graphs , the -M-Deletion problem consists in, given a graph G and an integer k, decide whether there exists with such that does not contain any of the graphs in as a minor. We provide lower bounds under the ETH on the smallest function such that -M-Deletion can be solved in time on n-vertex graphs, where denotes the treewidth of G. We first prove that for any containing connected graphs of size at least two, , even if G is planar. Our main result is that if contains a single connected graph H that is either or is not a minor of the , then .
中文翻译:
在有界树宽图上击中未成年人。三,下界
对于图的有限固定集合 , -M-Deletion问题在于,给定一个图G和一个整数k,确定是否存在 与 这样 不包含中的任何图形 作为未成年人。我们在ETH的最小功能上提供了下限 这样 -M-Deletion可以及时解决在n-顶点图上,其中表示G的树宽。我们首先证明 包含大小至少为两个的连通图, ,即使G是平面的。我们的主要结果是包含一个单一的连通图ħ要么是 或不是未成年人 , 然后 。