Linear rankwidth meets stability

11/15/2019
by   Jaroslav Nešetřil, et al.
0

Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths. These results show a strong link between the properties of these graph classes considered from the point of view of structural graph theory and from the point of view of finite model theory. We take both views on classes with bounded linear rankwidth and prove structural and model theoretic properties of these classes: 1) Graphs with linear rankwidth at most r are linearly . Actually, they have bounded c-chromatic number, meaning that they can be colored with f(r) colors, each color inducing a cograph. 2) Based on a Ramsey-like argument, we prove for every proper hereditary family F of graphs (like cographs) that there is a class with bounded rankwidth that does not have the property that graphs in it can be colored by a bounded number of colors, each inducing a subgraph in F. 3) For a class C with bounded linear rankwidth the following conditions are equivalent: a) C is stable, b) C excludes some half-graph as a semi-induced subgraph, c) C is a first-order transduction of a class with bounded pathwidth. These results open the perspective to study classes admitting low linear rankwidth covers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/04/2019

Classes of graphs with low complexity: the case of classes with bounded linear rankwidth

Classes with bounded rankwidth are MSO-transductions of trees and classe...
research
07/15/2020

Rankwidth meets stability

We study two notions of being well-structured for classes of graphs that...
research
03/31/2022

Transducing paths in graph classes with unbounded shrubdepth

Transductions are a general formalism for expressing transformations of ...
research
08/30/2022

On the first-order transduction quasiorder of hereditary classes of graphs

Logical transductions provide a very useful tool to encode classes of st...
research
03/02/2023

Canonical decompositions in monadically stable and bounded shrubdepth graph classes

We use model-theoretic tools originating from stability theory to derive...
research
03/26/2020

Regular partitions of gentle graphs

Szemeredi's Regularity Lemma is a very useful tool of extremal combinato...
research
11/22/2021

Homomorphism Tensors and Linear Equations

Lovász (1967) showed that two graphs G and H are isomorphic if and only ...

Please sign up or login with your details

Forgot password? Click here to reset