Tree pivot-minors and linear rank-width

by   Konrad K. Dabrowski, et al.

Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson and Seymour (1983) proved that for every tree T, the class of graphs that do not contain T as a minor has bounded path-width. For the pivot-minor relation, rank-width and linear rank-width take over the role from tree-width and path-width. As such, it is natural to examine if for every tree T, the class of graphs that do not contain T as a pivot-minor has bounded linear rank-width. We first prove that this statement is false whenever T is a tree that is not a caterpillar. We conjecture that the statement is true if T is a caterpillar. We are also able to give partial confirmation of this conjecture by proving: (1) for every tree T, the class of T-pivot-minor-free distance-hereditary graphs has bounded linear rank-width if and only if T is a caterpillar; (2) for every caterpillar T on at most four vertices, the class of T-pivot-minor-free graphs has bounded linear rank-width. To prove our second result, we only need to consider T=P_4 and T=K_1,3, but we follow a general strategy: first we show that the class of T-pivot-minor-free graphs is contained in some class of (H_1,H_2)-free graphs, which we then show to have bounded linear rank-width. In particular, we prove that the class of (K_3,S_1,2,2)-free graphs has bounded linear rank-width, which strengthens a known result that this graph class has bounded rank-width.


page 1

page 2

page 3

page 4


On the tree-width of even-hole-free graphs

The class of all even-hole-free graphs has unbounded tree-width, as it c...

Notes on Tree- and Path-chromatic Number

Tree-chromatic number is a chromatic version of treewidth, where the cos...

Obstructions for bounded shrub-depth and rank-depth

Shrub-depth and rank-depth are dense analogues of the tree-depth of a gr...

Logarithmic Weisfeiler–Leman Identifies All Graphs of Bounded Rank Width

In this paper, we extend the work of Grohe Neuen (ACM T. Comput. Log...

Factoring Pattern-Free Permutations into Separable ones

We show that for any permutation π there exists an integer k_π such that...

Monoidal Width: Capturing Rank Width

Monoidal width was recently introduced by the authors as a measure of th...

Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation

We introduce the 2-sorted counting logic GC^k that expresses properties ...

Please sign up or login with your details

Forgot password? Click here to reset