Lower bounds for protrusion replacement by counting equivalence classes

Abstract

Garnero et al. [SIAM J. Discrete Math. 2015, 29(4): recently introduced a framework based on dynamic programming to make applications of the protrusion replacement technique constructive and to obtain explicit upper bounds on the involved constants. They show that for several graph problems, for every boundary size t one can find an explicit set R t of representatives. Any subgraph H with a boundary of size t can be replaced with a representative H ∈ R t such that the effect of this replacement on the optimum can be deduced from H and H alone. Their upper bounds on the size of the graphs in R t grow triple-exponentially with t. In this paper we complement their results by lower bounds on the sizes of representatives, in terms of the boundary size t. For example, we show that each set of planar representatives R t for Independent Set or Dominating Set contains a graph with Ω(2 t / √ 4t) vertices. This lower bound even holds for sets that only represent the planar subgraphs of bounded pathwidth. To obtain our results we provide a lower bound on the number of equivalence classes of the canonical equivalence relation for Independent Set on t-boundaried graphs. We also find an elegant characterization of the number of equivalence classes in general graphs, in terms of the number of monotone functions of a certain kind. Our results show that the number of equivalence classes is at most 2 2 t , improving on earlier bounds of the form (t + 1) 2 t .

The Effect of Planarization on Width

“…One problem of this type arose in the work of Jansen and Wulms on the fixed-parameter tractability of graph optimization problems on graphs of bounded pathwidth [9]. One of their constructions involved the planarization of a nonplanar graph of bounded pathwidth, and they observed that the planarization maintained the low pathwidth of their graph.…”