Distal combinatorial tools for graphs of bounded twin-width

DOI10.1109/LICS56636.2023.10175719MaRDI QIDQ6851692zbMATH OpenFDO

Authors Wojciech Przybyszewski

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1109/LICS56636.2023.10175719

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cited in

(3)

• Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
• A polynomial Ramsey statement for bounded VC-dimension
• Indiscernibles in monadically NIP theories

This page was built for publication: Distal combinatorial tools for graphs of bounded twin-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851692)