Document Open Access Logo

MSO Undecidability for Hereditary Classes of Unbounded Clique Width

Authors Anuj Dawar , Abhisekh Sankaran

PDF
Thumbnail PDF

File

LIPIcs.CSL.2022.17.pdf
  • Filesize: 0.76 MB
  • 17 pages

Document Identifiers

Author Details

Anuj Dawar
  • Department of Computer Science and Technology, University of Cambridge, UK
Abhisekh Sankaran
  • Department of Computer Science and Technology, University of Cambridge, UK

Funding

Research supported by the Leverhulme Trust through a Research Project Grant on "Logical Fractals".

Cite As Get BibTex

Anuj Dawar and Abhisekh Sankaran. MSO Undecidability for Hereditary Classes of Unbounded Clique Width. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.CSL.2022.17

Abstract

Seese’s conjecture for finite graphs states that monadic second-order logic (MSO) is undecidable on all graph classes of unbounded clique-width. We show that to establish this it would suffice to show that grids of unbounded size can be interpreted in two families of graph classes: minimal hereditary classes of unbounded clique-width; and antichains of unbounded clique-width under the induced subgraph relation. We explore all the currently known classes of the former category and establish that grids of unbounded size can indeed be interpreted in them.

Subject Classification

ACM Subject Classification
  • Theory of computation → Finite Model Theory
Keywords
  • clique width
  • Seese’s conjecture
  • antichain
  • MSO interpretation
  • grid

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Aistis Atminas, Robert Brignall, Vadim V. Lozin, and Juraj Stacho. Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. arXiv preprint, 2015. URL: http://arxiv.org/abs/1503.01628.
  2. Robert Brignall and Daniel Cocks. Uncountably many minimal hereditary classes of graphs of unbounded clique-width. arXiv preprint, 2021. URL: http://arxiv.org/abs/2104.00412.
  3. Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim Lozin, and Victor Zamaraev. Infinitely many minimal classes of graphs of unbounded clique-width. Discrete Applied Mathematics, 248:145-152, 2018. Google Scholar
  4. Derek G Corneil and Udi Rotics. On the relationship between clique-width and treewidth. SIAM Journal on Computing, 34(4):825-847, 2005. Google Scholar
  5. Bruno Courcelle. The monadic second-order logic of graphs XV: On a conjecture by D. Seese. Journal of Applied Logic, 4(1):79-114, 2006. URL: https://doi.org/10.1016/j.jal.2005.08.004.
  6. Bruno Courcelle. From tree-decompositions to clique-width terms. Discret. Appl. Math., 248:125-144, 2018. URL: https://doi.org/10.1016/j.dam.2017.04.040.
  7. Bruno Courcelle and Joost Engelfriet. Graph structure and monadic second-order logic: a language-theoretic approach, volume 138. Cambridge University Press, 2012. Google Scholar
  8. Bruno Courcelle, Joost Engelfriet, and Grzegorz Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46(2):218-270, 1993. URL: https://doi.org/10.1016/0022-0000(93)90004-G.
  9. Bruno Courcelle and Sang il Oum. Vertex-minors, monadic second-order logic, and a conjecture by Seese. Journal of Combinatorial Theory, Series B, 97(1):91-126, 2007. URL: https://doi.org/10.1016/j.jctb.2006.04.003.
  10. Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101(1-3):77-114, 2000. Google Scholar
  11. Robert Ganian, Petr Hliněný, and Jan Obdrzálek. Clique-width: When hard does not mean impossible. In Thomas Schwentick and Christoph Dürr, editors, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, volume 9 of LIPIcs, pages 404-415. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. URL: https://doi.org/10.4230/LIPIcs.STACS.2011.404.
  12. Petr Hliněnỳ and Detlef Seese. Trees, grids, and MSO decidability: From graphs to matroids. Theoretical computer science, 351(3):372-393, 2006. Google Scholar
  13. Wilfrid Hodges. Model theory. Cambridge University Press, 1993. Google Scholar
  14. Nicholas Korpelainen. A new graph construction of unbounded clique-width. Electronic Notes in Discrete Mathematics, 56:31-36, 2016. Google Scholar
  15. Vadim V. Lozin. Minimal classes of graphs of unbounded clique-width. Annals of Combinatorics, 15(4):707-722, 2011. Google Scholar
  16. Vadim V. Lozin, Igor Razgon, and Viktor Zamaraev. Well-quasi-ordering does not imply bounded clique-width. In International Workshop on Graph-Theoretic Concepts in Computer Science, pages 351-359. Springer, 2015. Google Scholar
  17. Jaroslav Nešetřil and Patrice Ossona De Mendez. Sparsity: graphs, structures, and algorithms, volume 28. Springer Science & Business Media, 2012. Google Scholar
  18. Sang-il Oum and Paul Seymour. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B, 96(4):514-528, 2006. Google Scholar
  19. Neil Robertson and P.D. Seymour. Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory, Series B, 92(2):325-357, 2004. Special Issue Dedicated to Professor W.T. Tutte. URL: https://doi.org/10.1016/j.jctb.2004.08.001.
  20. Detlef Seese. The structure of the models of decidable monadic theories of graphs. Annals of pure and applied logic, 53(2):169-195, 1991. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact