English

Stable graphs of bounded twin-width

Logic in Computer Science 2022-09-20 v2 Discrete Mathematics Combinatorics

Abstract

We prove that every class of graphs C\mathscr C that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear cliquewidth and of bounded cliquewidth. It also implies that monadically stable classes of bounded twin-widthare linearly χ\chi-bounded.

Keywords

Cite

@article{arxiv.2107.03711,
  title  = {Stable graphs of bounded twin-width},
  author = {Jakub Gajarský and Michał Pilipczuk and Szymon Toruńczyk},
  journal= {arXiv preprint arXiv:2107.03711},
  year   = {2022}
}

Comments

45 pages, 5 figures

R2 v1 2026-06-24T03:59:37.345Z