eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2022-06-28
6:1
6:5
10.4230/LIPIcs.ICALP.2022.6
article
A Brief Tour in Twin-Width (Invited Talk)
Thomassé, Stéphan
1
Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, France
This is an introduction to the notion of twin-width, with emphasis on how it interacts with first-order model checking and enumerative combinatorics. Even though approximating twin-width remains a challenge in general graphs, it is now well understood for ordered graphs, where bounded twin-width coincides with many other complexity gaps. For instance classes of graphs with linear FO-model checking, small classes, or NIP classes are exactly bounded twin-width classes. Some other applications of twin-width are also presented.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol229-icalp2022/LIPIcs.ICALP.2022.6/LIPIcs.ICALP.2022.6.pdf
Twin-width
matrices
ordered graphs
enumerative combinatorics
model theory
algorithms
computational complexity
Ramsey theory