On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic

TL;DR

This paper introduces polynomial-time algorithms for constructing brambles and grid-like minors, leading to new insights into the intractability of monadic second-order logic on certain graph classes.

Contribution

It provides the first polynomial-time algorithm for constructing brambles and grid-like minors, and establishes lower bounds for MSO logic on classes of graphs.

Findings

Polynomial-time construction of brambles in general graphs.

Existence of polynomial-sized brambles of order sqrt(treewidth).

Lower bounds for MSO logic on graph classes.

Abstract

Brambles were introduced as the dual notion to treewidth, one of the most central concepts of the graph minor theory of Robertson and Seymour. Recently, Grohe and Marx showed that there are graphs G, in which every bramble of order larger than the square root of the treewidth is of exponential size in |G|. On the positive side, they show the existence of polynomial-sized brambles of the order of the square root of the treewidth, up to log factors. We provide the first polynomial time algorithm to construct a bramble in general graphs and achieve this bound, up to log-factors. We use this algorithm to construct grid-like minors, a replacement structure for grid-minors recently introduced by Reed and Wood, in polynomial time. Using the grid-like minors, we introduce the notion of a perfect bramble and an algorithm to find one in polynomial time. Perfect brambles are brambles with a particularly simple structure and they also provide us with a subgraph that has bounded degree and still large treewidth; we use them to obtain a meta-theorem on deciding certain parameterized subgraph-closed problems on general graphs in time singly exponential in the parameter. The second part of our work deals with providing a lower bound to Courcelle's famous theorem, stating that every graph property that can be expressed by a sentence in monadic second-order logic (MSO), can be decided by a linear time algorithm on classes of graphs of bounded treewidth. Using our results from the first part of our work we establish a strong lower bound for tractability of MSO on classes of colored graphs.