8 research outputs found
Twin-width IV: ordered graphs and matrices
We establish a list of characterizations of bounded twin-width for
hereditary, totally ordered binary structures. This has several consequences.
First, it allows us to show that a (hereditary) class of matrices over a finite
alphabet either contains at least matrices of size , or at
most for some constant . This generalizes the celebrated Stanley-Wilf
conjecture/Marcus-Tardos theorem from permutation classes to any matrix class
over a finite alphabet, answers our small conjecture [SODA '21] in the case of
ordered graphs, and with more work, settles a question first asked by Balogh,
Bollob\'as, and Morris [Eur. J. Comb. '06] on the growth of hereditary classes
of ordered graphs. Second, it gives a fixed-parameter approximation algorithm
for twin-width on ordered graphs. Third, it yields a full classification of
fixed-parameter tractable first-order model checking on hereditary classes of
ordered binary structures. Fourth, it provides a model-theoretic
characterization of classes with bounded twin-width.Comment: 53 pages, 18 figure
Twin-width I: tractable FO model checking
Inspired by a width invariant defined on permutations by Guillemot and Marx
[SODA '14], we introduce the notion of twin-width on graphs and on matrices.
Proper minor-closed classes, bounded rank-width graphs, map graphs, -free
unit -dimensional ball graphs, posets with antichains of bounded size, and
proper subclasses of dimension-2 posets all have bounded twin-width. On all
these classes (except map graphs without geometric embedding) we show how to
compute in polynomial time a sequence of -contractions, witness that the
twin-width is at most . We show that FO model checking, that is deciding if
a given first-order formula evaluates to true for a given binary
structure on a domain , is FPT in on classes of bounded
twin-width, provided the witness is given. More precisely, being given a
-contraction sequence for , our algorithm runs in time where is a computable but non-elementary function. We also prove that
bounded twin-width is preserved by FO interpretations and transductions
(allowing operations such as squaring or complementing a graph). This unifies
and significantly extends the knowledge on fixed-parameter tractability of FO
model checking on non-monotone classes, such as the FPT algorithm on
bounded-width posets by Gajarsk\'y et al. [FOCS '15].Comment: 49 pages, 9 figure
LIPIcs, Volume 258, SoCG 2023, Complete Volume
LIPIcs, Volume 258, SoCG 2023, Complete Volum
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum