Twin-width I: Tractable FO
Model Checking by Bonnet, Kim, Thomassé, Watrigant
https://www.doi.org/10.1145/3486655
@article{twinWidthI2021,
location = {New York, NY, USA},
articleno = {3},
author = {Édouard Bonnet and Eun Jung Kim and Stéphan Thomassé and Rémi Watrigant},
doi = {10.1145/3486655},
issn = {0004-5411},
journaltitle = {J. ACM},
month = {November},
number = {1},
publisher = {Association for Computing Machinery},
title = {Twin-width I: Tractable {FO} Model Checking},
volume = {69},
year = {2021},
}
- page 2 : twin-width – … we consider a sequence of graphs
, where is the original graph , is the one-vertex graph, has vertices, and is obtained from by performing a single contraction of two (non-necessarily adjacent) vertices. For every vertex , let us denote by the vertices of which have been contracted to along the sequence . A pair of disjoint sets of vertices is \emph{homogeneous} if, between these sets, there are either all possible edges or no edge at all. The red edges … consist of all pairs of vertices of such that and are not homogeneous in . If the red degree of every is at most , then is called a \emph{sequence of -contractions}, or \emph{ -sequence}. The twin-width of is the minimum for which there exists a sequence of -contractions. - page 15 : graph class grid has constant twin-width – Theorem 4.3. For every positive integers
and , the -dimensional -grid has twin-width at most .