Document Open Access Logo

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO

Author Nikolas Mählmann

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.167.pdf
  • Filesize: 1.04 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Finite Model Theory
Keywords
  • Shrub-Depth
  • Forbidden Induced Subgraphs
  • MSO
  • Stability Theory

Metrics

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

Abstract

The graph parameter shrub-depth is a dense analog of tree-depth. We characterize classes of bounded shrub-depth by forbidden induced subgraphs. The obstructions are well-controlled flips of large half-graphs and of disjoint unions of many long paths. Applying this characterization, we show that on every hereditary class of unbounded shrub-depth, MSO is more expressive than FO. This confirms a conjecture of [Gajarský and Hliněný; LMCS 2015] who proved that on classes of bounded shrub-depth FO and MSO have the same expressive power. Combined, the two results fully characterize the hereditary classes on which FO and MSO coincide, answering an open question by [Elberfeld, Grohe, and Tantau; LICS 2012].
Our work is inspired by the notion of stability from model theory. A graph class 𝒞 is MSO-stable, if no MSO-formula can define arbitrarily long linear orders in graphs from 𝒞. We show that a hereditary graph class is MSO-stable if and only if it has bounded shrub-depth. As a key ingredient, we prove that every hereditary class of unbounded shrub-depth FO-interprets the class of all paths. This improves upon a result of [Ossona de Mendez, Pilipczuk, and Siebertz; Eur. J. Comb. 2025] who showed the same statement for FO-transductions instead of FO-interpretations.

Cite As Get BibTex

Nikolas Mählmann. Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 167:1-167:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.167

Author Details

Nikolas Mählmann
  • University of Bremen, Germany

Funding

Supported by the German Research Foundation (DFG) with grant agreement No. 444419611.

Acknowledgements

The author thanks Patrice Ossona de Mendez, Sebastian Siebertz, and Szymon Toruńczyk for fruitful discussions on the topic of this paper.

References

  1. Hans Adler and Isolde Adler. Interpreting nowhere dense graph classes as a classical notion of model theory. European Journal of Combinatorics, 36:322-330, 2014. URL: https://doi.org/10.1016/J.EJC.2013.06.048.
  2. Peter John Anderson. Tree-decomposable theories. Master’s thesis, Simon Fraser University, 1990. Google Scholar
  3. John T. Baldwin and Saharon Shelah. Second-order quantifiers and the complexity of theories. Notre Dame Journal of Formal Logic, 26(3):229-303, 1985. URL: https://doi.org/10.1305/NDJFL/1093870870.
  4. Samuel Braunfeld and Michael C. Laskowski. Existential characterizations of monadic nip. arXiv preprint arXiv:2209.05120, 2022. URL: https://arxiv.org/abs/2209.05120.
  5. Hector Buffière, Eun Jung Kim, and Patrice Ossona de Mendez. Shallow vertex minors, stability, and dependence. Innovations in Graph Theory, 1:87-112, 2024. URL: https://doi.org/10.5802/igt.5.
  6. Bruno Courcelle and Joost Engelfriet. Graph structure and monadic second-order logic: a language-theoretic approach, volume 138. Cambridge University Press, 2012. Google Scholar
  7. 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.
  8. Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, and Szymon Toruńczyk. First-Order Model Checking on Monadically Stable Graph Classes . In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pages 21-30, Los Alamitos, CA, USA, October 2024. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS61266.2024.00012.
  9. Jan Dreier, Nikolas Mählmann, and Sebastian Siebertz. First-order model checking on structurally sparse graph classes. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 567-580, New York, NY, USA, 2023. Association for Computing Machinery. URL: https://doi.org/10.1145/3564246.3585186.
  10. Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, and Szymon Toruńczyk. Indiscernibles and flatness in monadically stable and monadically NIP classes. In Kousha Etessami, Uriel Feige, and Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, volume 261 of LIPIcs, pages 125:1-125:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.125.
  11. Jan Dreier, Nikolas Mählmann, and Szymon Toruńczyk. Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pages 1550-1560, New York, NY, USA, 2024. Association for Computing Machinery. URL: https://doi.org/10.1145/3618260.3649739.
  12. Michael Elberfeld, Martin Grohe, and Till Tantau. Where first-order and monadic second-order logic coincide. ACM Trans. Comput. Logic, 17(4), September 2016. URL: https://doi.org/10.1145/2946799.
  13. Ronald Fagin, Larry J. Stockmeyer, and Moshe Y. Vardi. On monadic np vs monadic co-np. Information and Computation, 120(1):78-92, 1995. URL: https://doi.org/10.1006/inco.1995.1100.
  14. Jakub Gajarský and Petr Hliněný. Kernelizing mso properties of trees of fixed height, and some consequences. Logical Methods in Computer Science, Volume 11, Issue 1, April 2015. URL: https://doi.org/10.2168/LMCS-11(1:19)2015.
  15. Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokołowski, and Szymon Toruńczyk. Flipper Games for Monadically Stable Graph Classes. In Kousha Etessami, Uriel Feige, and Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), volume 261 of Leibniz International Proceedings in Informatics (LIPIcs), pages 128:1-128:16, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.128.
  16. 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 MSO1. In Branislav Rovan, Vladimiro Sassone, and Peter Widmayer, editors, Mathematical Foundations of Computer Science 2012, pages 419-430, Berlin, Heidelberg, 2012. Springer Berlin Heidelberg. Google Scholar
  17. Robert Ganian, Petr Hliněný, Jaroslav Nesetril, Jan Obdrzá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.
  18. Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. Deciding first-order properties of nowhere dense graphs. Journal of the ACM (JACM), 64(3):1-32, 2017. URL: https://doi.org/10.1145/3051095.
  19. William Hanf. Model-theoretic methods in the study of elementary logic. In The Theory of Models, Studies in Logic and the Foundations of Mathematics, pages 132-145. North-Holland, 1965. URL: https://doi.org/10.1016/B978-0-7204-2233-7.50020-4.
  20. Wilfrid Hodges. A Shorter Model Theory. Cambridge University Press, 1997. Google Scholar
  21. O-joung Kwon, Rose McCarty, Sang il Oum, and Paul Wollan. Obstructions for bounded shrub-depth and rank-depth. Journal of Combinatorial Theory, Series B, 149:76-91, 2021. URL: https://doi.org/10.1016/j.jctb.2021.01.005.
  22. Michael Lampis. Model checking lower bounds for simple graphs. Logical Methods in Computer Science, Volume 10, Issue 1, March 2014. URL: https://doi.org/10.2168/LMCS-10(1:18)2014.
  23. Leonid Libkin. Elements of finite model theory, volume 41. Springer, 2004. URL: https://doi.org/10.1007/978-3-662-07003-1.
  24. Nikolas Mählmann. Monadically Stable and Monadically Dependent Graph Classes: Characterizations and Algorithmic Meta-Theorems. PhD thesis, University of Bremen, 2024. Google Scholar
  25. Nikolas Mählmann. Forbidden induced subgraphs for bounded shrub-depth and the expressive power of mso. arXiv preprint arXiv:2501.13903, 2025. URL: https://doi.org/10.48550/arXiv.2501.13903.
  26. Jaroslav Nešetřil and Patrice Ossona de Mendez. On nowhere dense graphs. European Journal of Combinatorics, 32(4):600-617, 2011. URL: https://doi.org/10.1016/J.EJC.2011.01.006.
  27. Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk. Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. In Kousha Etessami, Uriel Feige, and Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), volume 261 of Leibniz International Proceedings in Informatics (LIPIcs), pages 135:1-135:17, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.135.
  28. Patrice Ossona de Mendez, Michał Pilipczuk, and Sebastian Siebertz. Transducing paths in graph classes with unbounded shrubdepth. European Journal of Combinatorics, 123:103660, 2025. SI: Sparsity in Algorithms, Combinatorics and Logic. URL: https://doi.org/10.1016/j.ejc.2022.103660.
  29. Klaus-Peter Podewski and Martin Ziegler. Stable graphs. Fundamenta Mathematicae, 100(2):101-107, 1978. URL: http://eudml.org/doc/210953.
  30. Detlef Seese. The structure of the models of decidable monadic theories of graphs. Annals of Pure and Applied Logic, 53(2):169-195, 1991. URL: https://doi.org/10.1016/0168-0072(91)90054-P.
  31. Pierre Simon. A note on stability and nip in one variable. arXiv preprint arXiv:2103.15799, 2021. URL: https://arxiv.org/abs/2103.15799.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact