Log In Sign Up

On the nonexistence of FO-continuous path and tree-decompositions

by   Julien Grange, et al.

Bojanczyk and Pilipczuk showed in their celebrated article "Definability equals recognizability for graphs of bounded treewidth" (LICS 2016) that monadic second-order logic can define tree-decompositions in graphs of bounded treewidth. This raises the question whether such decompositions can already be defined in first-order logic (FO). We start by introducing the notion of tree-decompositions of bounded span, which restricts the diameter of the subtree consisting of the bags containing a same node of the structure. Having a bounded span is a natural property of tree-decompositions when dealing with FO, since equality of nodes cannot in general be recovered in FO when it doesn't hold. In particular, it encompasses the notion of domino tree-decompositions. We show that path-decompositions of bounded span are not FO-continuous, in the sense that there exist arbitrarily FO-similar graphs of bounded pathwidth which do not possess FO-similar path-decompositions of bounded span. Then, we show that tree-decompositions of bounded span are not FO-continuous either.


page 1

page 2

page 3

page 4


Lean tree-cut decompositions: obstructions and algorithms

The notion of tree-cut width has been introduced by Wollan [The structur...

Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm

In 1996, Bodlaender showed the celebrated result that an optimal tree de...

Graphs of bounded cliquewidth are polynomially χ-bounded

We prove that if C is a hereditary class of graphs that is polynomially ...

Bounding Search Space Size via (Hyper)tree Decompositions

This paper develops a measure for bounding the performance of AND/OR sea...

Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs

Our team has recently demonstrated that clan decompositions of generaliz...

An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version)

Treewidth is a parameter that measures how tree-like a relational instan...

As Time Goes By: Reflections on Treewidth for Temporal Graphs

Treewidth is arguably the most important structural graph parameter lead...