Document Open Access Logo

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes

Authors Pierre Ohlmann , Michał Pilipczuk , Wojciech Przybyszewski , Szymon Toruńczyk

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2023.135.pdf
  • Filesize: 0.88 MB
  • 17 pages

Document Identifiers

Author Details

Pierre Ohlmann
  • Institute of Informatics, University of Warsaw, Poland
Michał Pilipczuk
  • Institute of Informatics, University of Warsaw, Poland
Wojciech Przybyszewski
  • Institute of Informatics, University of Warsaw, Poland
Szymon Toruńczyk
  • Institute of Informatics, University of Warsaw, Poland

Funding

This paper is part of a project that have received funding from the European Research Council (ERC) (grant agreement No 948057 - BOBR).

Acknowledgements

We are indebted to Pierre Simon for enlightening discussions about classic results in stability theory that greatly helped in deriving the results presented in this work. We also thank Jakub Gajarský, Rose McCarty, and Marek Sokołowski for their contribution in discussions around the topic of this work.

Cite AsGet BibTex

Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk. Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 135:1-135:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ICALP.2023.135

Abstract

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class 𝒞, and using a first-order formula φ with parameters we are able to define, in every graph G ∈ 𝒞, a relation R that satisfies some hereditary first-order assertion ψ. Then we are able to find a first-order formula φ' that has the same property, but additionally is finitary: there is finite bound k ∈ ℕ such that in every graph G ∈ 𝒞, different choices of parameters give only at most k different relations R that can be defined using φ'. We use the Finitary Substitute Lemma to derive two corollaries about the existence of certain canonical decompositions in classes of well-structured graphs. - We prove that in the Splitter game, which characterizes nowhere dense graph classes, and in the Flipper game, which characterizes monadically stable graph classes, there is a winning strategy for Splitter, respectively Flipper, that can be defined in first-order logic from the game history. Thus, the strategy is canonical. - We show that for any fixed graph class 𝒞 of bounded shrubdepth, there is an 𝒪(n²)-time algorithm that given an n-vertex graph G ∈ 𝒞, computes in an isomorphism-invariant way a structure H of bounded treedepth in which G can be interpreted. A corollary of this result is an 𝒪(n²)-time isomorphism test and canonization algorithm for any fixed class of bounded shrubdepth.

Subject Classification

ACM Subject Classification
  • Theory of computation → Finite Model Theory
Keywords
  • Model Theory
  • Stability Theory
  • Shrubdepth
  • Nowhere Dense
  • Monadically Stable

Metrics

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

Related Versions

References

  1. Algorithms, Logic and Structure Workshop in Warwick - Open Problem Session. URL: https://warwick.ac.uk/fac/sci/maths/people/staff/daniel_kral/alglogstr/openproblems.pdf, 2016.
  2. Hans Adler and Isolde Adler. Interpreting nowhere dense graph classes as a classical notion of model theory. Eur. J. Comb., 36:322-330, 2014. URL: https://doi.org/10.1016/j.ejc.2013.06.048.
  3. Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, and Szymon Torunczyk. Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. In LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, pages 54:1-54:13. ACM, 2022. URL: https://doi.org/10.1145/3531130.3533367.
  4. Adam Bouland, Anuj Dawar, and Eryk Kopczyński. On Tractable Parameterizations of Graph Isomorphism. In 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, volume 7535 of Lecture Notes in Computer Science, pages 218-230. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-33293-7_21.
  5. Samuel Braunfeld and Michael C. Laskowski. Characterizations of monadic NIP. Transactions of the American Mathematical Society, Series B, 8(30):948-970, 2021. URL: https://doi.org/10.1090/btran/94.
  6. Samuel Braunfeld and Michael C. Laskowski. Existential characterizations of monadic NIP. CoRR, abs/2209.05120, 2022. URL: https://doi.org/10.48550/arXiv.2209.05120.
  7. Samuel Braunfeld, Jaroslav Nešetřil, Patrice Ossona de Mendez, and Sebastian Siebertz. Decomposition horizons: from graph sparsity to model-theoretic dividing lines. CoRR, abs/2209.11229, 2022. URL: https://doi.org/10.48550/arXiv.2209.11229.
  8. Yijia Chen and Jörg Flum. FO-Definability of Shrub-Depth. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, volume 152 of LIPIcs, pages 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.CSL.2020.15.
  9. Artem Chernikov. Lecture notes on stability theory. AMS Open Math Notes (OMN: 201905.110792), 2019. Google Scholar
  10. Jan Dreier, Nikolas Mählmann, and Sebastian Siebertz. First-order model checking on structurally sparse graph classes. CoRR, abs/2302.03527, 2023. URL: https://doi.org/10.48550/arXiv.2302.03527.
  11. Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, and Szymon Torunczyk. Indiscernibles and flatness in monadically stable and monadically NIP classes. CoRR, abs/2206.13765, 2022. URL: https://doi.org/10.48550/arXiv.2206.13765.
  12. Fedor V. Fomin and Tuukka Korhonen. Fast FPT-approximation of branchwidth. In 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC '22, pages 886-899. ACM, 2022. URL: https://doi.org/10.1145/3519935.3519996.
  13. Jakub Gajarský and Petr Hliněný. Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, volume 18 of LIPIcs, pages 112-123. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2012.112.
  14. Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Sebastian Siebertz, and Szymon Toruńczyk. First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log., 21(4):29:1-29:41, 2020. URL: https://doi.org/10.1145/3382093.
  15. Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, and Szymon Torunczyk. Flipper games for monadically stable graph classes. CoRR, abs/2301.13735, 2023. URL: https://doi.org/10.48550/arXiv.2301.13735.
  16. Robert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdržálek, and Patrice Ossona de Mendez. Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci., 15(1), 2019. URL: https://doi.org/10.23638/LMCS-15(1:7)2019.
  17. Robert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdržálek, Patrice Ossona de Mendez, and Reshma Ramadurai. When Trees Grow Low: Shrubs and Fast MSO₁. In 37th International Symposium on Mathematical Foundations of Computer Science 2012, MFCS 2012, volume 7464 of Lecture Notes in Computer Science, pages 419-430. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-32589-2_38.
  18. Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. Deciding First-Order Properties of Nowhere Dense Graphs. J. ACM, 64(3):17:1-17:32, 2017. URL: https://doi.org/10.1145/3051095.
  19. Martin Grohe and Daniel Neuen. Isomorphism, canonization, and definability for graphs of bounded rank width. Commun. ACM, 64(5):98-105, 2021. URL: https://doi.org/10.1145/3453943.
  20. Martin Grohe and Pascal Schweitzer. Isomorphism Testing for Graphs of Bounded Rank Width. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, pages 1010-1029. IEEE Computer Society, 2015. URL: https://doi.org/10.1109/FOCS.2015.66.
  21. Wojciech Kazana and Luc Segoufin. Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log., 14(4):25:1-25:12, 2013. URL: https://doi.org/10.1145/2528928.
  22. O-joung Kwon, Rose McCarty, Sang-il Oum, and Paul Wollan. Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory, Ser. B, 149:76-91, 2021. URL: https://doi.org/10.1016/j.jctb.2021.01.005.
  23. Jaroslav Nešetřil and Patrice Ossona de Mendez. Sparsity: Graphs, Structures, and Algorithms, volume 28 of Algorithms and Combinatorics. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-27875-4.
  24. A. Pillay. Geometric Stability Theory. Oxford logic guides. Clarendon Press, 1996. URL: https://books.google.pl/books?id=k6FK_Gqal2EC.
  25. Klaus-Peter Podewski and Martin Ziegler. Stable graphs. Fundamenta Mathematicae, 100(2):101-107, 1978. URL: https://doi.org/10.4064/fm-100-2-101-107.
  26. Saharon Shelah. Classification theory - and the number of non-isomorphic models, volume 92 of Studies in logic and the foundations of mathematics. North-Holland Publishing Co., 1978. Google Scholar
  27. Katrin Tent and Martin Ziegler. A Course in Model Theory. Lecture Notes in Logic. Cambridge University Press, 2012. URL: https://doi.org/10.1017/CBO9781139015417.
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 Schloss Dagstuhl - LZI GmbH Imprint Privacy Contact