Definable Tree Decompositions

We introduce a notion of definable tree decompositions of graphs. Actually, a definable tree decomposition of a graph is not just a tree decomposition, but a more complicated structure that represents many different tree decompositions of the graph. It is definable in the graph by a tuple of formulas of some logic. In this paper, only study tree decomposition definable in fixed-point logic. We say that a definable tree decomposition is over a class of graphs if the pieces of the decomposition are in this class. We prove two general theorems lifting definability results from the pieces of a tree decomposition of a graph to the whole graph. Besides unifying earlier work on fixed-point definability and descriptive complexity theory on planar graphs and graphs of bounded tree width, these general results can be used to prove that the class of all graphs without a K5-minor is definable infixed-point logic and that fixed-point logic with counting captures polynomial time on this class.

[1]  Martin Otto,et al.  Ptime canonization for two variables with counting , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[2]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[3]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[4]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5]  Martin Otto,et al.  Bounded Variable Logics and Counting , 1997 .

[6]  Hans L. Bodlaender,et al.  Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees , 1988, J. Algorithms.

[7]  K. Wagner.  Beweis einer Abschwächung der Hadwiger-Vermutung , 1964 .

[8]  Martin Grohe,et al.  Definability and Descriptive Complexity on Databases of Bounded Tree-Width , 1999, ICDT.

[9]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[10]  Martin Grohe,et al.  Isomorphism testing for embeddable graphs through definability , 2000, STOC '00.

[11]  Maarten Marx,et al.  Finite Model Theory and Its Applications , 2007, Texts in Theoretical Computer Science. An EATCS Series.

[12]  Martin Grohe,et al.  The Quest for a Logic Capturing PTIME , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[13]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[14]  Hans L. Boblaender.  Polynomial algorithms for graph isomorphism and chromatic index on partial k -trees , 1990 .

[15]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[16]  Martin Grohe,et al.  Fixed-point logics on planar graphs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[17]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[18]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[19]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[20]  Neil Immerman.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[21]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[22]  Martin Otto,et al.  The expressive power of fixed-point logic with counting , 1996, Journal of Symbolic Logic.

[23]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

[24]  Jörg Flum,et al.  On fixed-point logic with counting , 2000, Journal of Symbolic Logic.

[25]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.

[26]  Paul D. Seymour,et al.  Graph Minors: XVII. Taming a Vortex , 1999, J. Comb. Theory, Ser. B.

[27]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[28]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.