Structurally Tractable Graph Classes (Invited Talk)

Author Szymon Toruńczyk

Thumbnail PDF


  • Filesize: 345 kB
  • 1 pages

Document Identifiers

Author Details

Szymon Toruńczyk
  • Institute of Informatics, University of Warsaw, Poland

Cite AsGet BibTex

Szymon Toruńczyk. Structurally Tractable Graph Classes (Invited Talk). In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)


Sparsity theory, initiated by Ossona de Mendez and Nešetřil, identifies those classes of sparse graphs that are tractable in various ways - algorithmically, combinatorially, and logically - as exactly the nowhere dense classes. An ongoing effort aims at generalizing sparsity theory to classes of graphs that are not necessarily sparse. Twin-width theory, developed by Bonnet, Thomassé and co-authors, is a step in that direction. A theory unifying the two is anticipated. It is conjectured that the relevant notion characterising dense graph classes that are tractable, generalising nowhere denseness and bounded twin-width, is the notion of a monadically dependent class, introduced by Shelah in model theory. I will survey the recent, rapid progress in the understanding of those classes, and of the related monadically stable classes. This development combines tools from structural graph theory, logic (finite and infinite model theory), and algorithms (parameterised algorithms and range search queries).

Subject Classification

ACM Subject Classification
  • Theory of computation → Finite Model Theory
  • Theory of computation → Complexity theory and logic
  • Theory of computation → Fixed parameter tractability
  • Mathematics of computing → Graph algorithms
  • Structural graph theory
  • Monadic dependence
  • monadic NIP
  • twin-width


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail