Document Open Access Logo

Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide

Authors Fatemeh Ghasemi , Julien Grange , Mamadou Moustapha Kanté , Florent Madelaine

PDF

File

Thumbnail PDF
PDF
LIPIcs.CSL.2026.41.pdf
  • Filesize: 0.93 MB
  • 14 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Finite Model Theory
  • Mathematics of computing → Graph algorithms
Keywords
  • Almost-wide
  • Flip-flatness

Metrics

Abstract

In this work we take a step towards characterising strongly flip-flat classes of graphs. Strong flip-flatness appears to be the analogue of uniform almost-wideness in the setting of dense classes of graphs. We prove that strongly flip-flat classes of graphs that are weakly sparse are indeed uniformly almost-wide.

Cite As Get BibTex

Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté, and Florent Madelaine. Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide. In 34th EACSL Annual Conference on Computer Science Logic (CSL 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 363, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.CSL.2026.41

Author Details

Fatemeh Ghasemi
  • Univ Paris Est Creteil, LACL, F-94010 Creteil, France
Julien Grange
  • Univ Paris Est Creteil, LACL, F-94010 Creteil, France
Mamadou Moustapha Kanté
  • Université Clermont Auvergne, Clermont Auvergne INP, LIMOS, CNRS, Clermont-Ferrand, France
Florent Madelaine
  • Univ Paris Est Creteil, LACL, F-94010 Creteil, France

Funding

This work is Supported by French National Research Agency under PRC program ANR-20-CE48-0002.
  • Ghasemi, Fatemeh: F.~Ghasemi wants to thank Fond de recherche IUT Sénart-Fontainebleau.

References

  1. Algorithms, logic and structure workshop in warwick - open problem session. https://warwick.ac.uk/fac/sci/maths/people/staff/daniel_kral/alglogstr/openproblems.pdf, 2016. [Online; accessed 23-Jan-2023].
  2. Samson Abramsky and Luca Reggio. Arboreal categories and equi-resource homomorphism preservation theorems. Ann. Pure Appl. Log., 2024. URL: https://doi.org/10.1016/J.APAL.2024.103423.
  3. Hans Adler and Isolde Adler. Interpreting nowhere dense graph classes as a classical notion of model theory. Eur. J. Comb., 2014. URL: https://doi.org/10.1016/J.EJC.2013.06.048.
  4. Albert Atserias, Anuj Dawar, and Martin Grohe. Preservation under extensions on well-behaved finite structures. SIAM J. Comput., 2008. URL: https://doi.org/10.1137/060658709.
  5. Albert Atserias, Anuj Dawar, and Phokion G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. J. ACM, 2006. URL: https://doi.org/10.1145/1131342.1131344.
  6. John T. Baldwin. Finite and infinite model theory - A historical perspective. Log. J. IGPL, 2000. URL: https://doi.org/10.1093/JIGPAL/8.5.605.
  7. John T. Baldwin and Saharon Shelah. Second-order quantifiers and the complexity of theories. Notre Dame J. Formal Log., 1985. URL: https://doi.org/10.1305/NDJFL/1093870870.
  8. John Adrian Bondy and Uppaluri Siva Ramachandra Murty. Graph theory. Springer Publishing Company, Incorporated, 2008. Google Scholar
  9. Hector Buffière, Eun Jung Kim, and Patrice Ossona de Mendez. Shallow vertex minors, stability, and dependence, 2024. URL: https://arxiv.org/abs/2405.00408.
  10. Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discret. Appl. Math., 2000. URL: https://doi.org/10.1016/S0166-218X(99)00184-5.
  11. Anuj Dawar. Homomorphism preservation on quasi-wide classes. J. Comput. Syst. Sci., 76, 2010. URL: https://doi.org/10.1016/J.JCSS.2009.10.005.
  12. Anuj Dawar and Ioannis Eleftheriadis. Preservation theorems on sparse classes revisited. In 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, August 26-30, 2024, 2024. URL: https://doi.org/10.4230/LIPIcs.MFCS.2024.47.
  13. Patrice Ossona de Mendez. First-order transductions of graphs (invited talk). In 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbrücken, Germany (Virtual Conference), March 16-19, 2021, 2021. URL: https://doi.org/10.4230/LIPIcs.STACS.2021.2.
  14. Patrice Ossona de Mendez, Michal Pilipczuk, and Sebastian Siebertz. Transducing paths in graph classes with unbounded shrubdepth. Eur. J. Comb., 2025. URL: https://doi.org/10.1016/J.EJC.2022.103660.
  15. Reinhard Diestel. Graph theory. Springer (print edition); Reinhard Diestel (eBooks), 2024. Google Scholar
  16. Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, and Szymon Torunczyk. First-order model checking on monadically stable graph classes. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30, 2024, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00012.
  17. 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, Orlando, FL, USA, June 20-23, 2023, New York, NY, USA, 2023. Association for Computing Machinery. URL: https://doi.org/10.1145/3564246.3585186.
  18. Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, and Szymon Torunczyk. Indiscernibles and flatness in monadically stable and monadically NIP classes. In 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, July 10-14, 2023, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.125.
  19. Jan Dreier, Nikolas Mählmann, and Szymon Torunczyk. Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024, 2024. URL: https://doi.org/10.1145/3618260.3649739.
  20. Zdenek Dvorák. Induced subdivisions and bounded expansion. Eur. J. Comb., 2018. URL: https://doi.org/10.1016/J.EJC.2017.10.004.
  21. Heinz-Dieter Ebbinghaus and Jörg Flum. Finite model theory. Perspectives in Mathematical Logic. Springer, 1995. Google Scholar
  22. Ioannis Eleftheriadis. Extension preservation on dense graph classes. In 33rd EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, The Netherlands, February 10-14, 2025, 2025. URL: https://doi.org/10.4230/LIPIcs.CSL.2025.7.
  23. Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, and Szymon Torunczyk. First-order interpretations of bounded expansion classes. ACM Trans. Comput. Log., 2020. URL: https://doi.org/10.1145/3382093.
  24. Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, and Szymon Torunczyk. Flipper games for monadically stable graph classes. In 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, July 10-14, 2023, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.128.
  25. Jakub Gajarský, Michal Pilipczuk, and Szymon Torunczyk. Stable graphs of bounded twin-width. In LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, 2022. URL: https://doi.org/10.1145/3531130.3533356.
  26. Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, and Reshma Ramadurai. When trees grow low: Shrubs and fast MSO1. In Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, 2012. URL: https://doi.org/10.1007/978-3-642-32589-2_38.
  27. Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. Deciding first-order properties of nowhere dense graphs. J. ACM, 2017. URL: https://doi.org/10.1145/3051095.
  28. Frank Gurski and Egon Wanke. The tree-width of clique-width bounded graphs without K_n, n. In Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, 2000. URL: https://doi.org/10.1007/3-540-40064-8_19.
  29. Wilfrid Hodges. Model theory. Cambridge university press, 1993. Google Scholar
  30. Leonid Libkin. Elements of finite model theory, volume 41. Springer, 2004. URL: https://doi.org/10.1007/978-3-662-07003-1.
  31. Mählmann. Monadically Stable and Monadically Dependent Graph Classes: Characterizations and Algorithmic Meta-Theorems. PhD thesis, PhD Thesis, 2024. Google Scholar
  32. 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, Aarhus, Denmark, July 8-11, 2025, 2025. URL: https://doi.org/10.4230/LIPIcs.ICALP.2025.167.
  33. 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.
  34. Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, and Sebastian Siebertz. Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb., 2021. URL: https://doi.org/10.1016/J.EJC.2020.103223.
  35. Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, and Sebastian Siebertz. Linear rankwidth meets stability. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, 2020. URL: https://doi.org/10.1137/1.9781611975994.72.
  36. Klaus-Peter Podewski and Martin Ziegler. Stable graphs. Fund. Math, 100(2):101-107, 1978. Google Scholar
  37. Saharon Shelah. Classification theory - and the number of non-isomorphic models, Second Edition. Studies in logic and the foundations of mathematics. Elsevier, 1990. Google Scholar
  38. William W. Tait. A counterexample to a conjecture of scott and suppes. J. Symb. Log., 1959. URL: https://doi.org/10.2307/2964569.
  39. Szymon Torunczyk. Flip-width: Cops and robber on dense graphs. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00045.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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