Sciweavers

Share
JAPLL
2006

The monadic second-order logic of graphs XV: On a conjecture by D. Seese

10 years 1 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monadic second-order formulas. We prove that the general case of this conjecture is equivalent to the particular cases of directed graphs, partial orders and comparability graphs. We present some tools to prove the conjecture for classes of graphs with few cliques or few complete bipartite subgraphs, for line graphs and for interval graphs. We make an essential use of prime graphs, of comparability graphs and of characterizations of graph classes by forbidden induced subgraphs. Our treatment of infinite graphs uses a representation of countable linear orders by binary trees that can be constructed by monadic second-order formulas. By using a counting argument, we show the intrinsic limits of the methods used so far to handle this conjecture.
Bruno Courcelle
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JAPLL
Authors Bruno Courcelle
Comments (0)
books