A ladder is a 2xk grid graph. When does a graph class C exclude some ladder as a minor? We show that this is the case if and only if all graphs G in C admit a proper vertex coloring with a bounded number of colors such that for every 2-connected subgraph H of G, there is a color that appears exactly once in H. This type of vertex coloring is a relaxation of the notion of centered coloring, where for every connected subgraph H of G, there must be a color that appears exactly once in H. The minimum number of colors in a centered coloring of G is the treedepth of G, and it is known that classes of graphs with bounded treedepth are exactly those that exclude a fixed path as a subgraph, or equivalently, as a minor. In this sense, the structure of graphs excluding a fixed ladder as a minor resembles the structure of graphs without long paths. Another similarity is as follows: It is an easy observation that every connected graph with two vertex-disjoint paths of length k has a path of length k + 1. We show that every 3-connected graph which contains as a minor a union of sufficiently many vertex-disjoint copies of a 2 x k grid has a 2x(k + 1) grid minor.Our structural results have applications to poset dimension. We show that posets whose cover graphs exclude a fixed ladder as a minor have bounded dimension. This is a new step towards the goal of understanding which graphs are unavoidable as minors in cover graphs of posets with large dimension.

Excluding a Ladder / Huynh, T.; Joret, G.; Micek, P.; Seweryn, M. T.; Wollan, P.. - In: COMBINATORICA. - ISSN 0209-9683. - 42:3(2022), pp. 405-432. [10.1007/s00493-021-4592-8]

#### Abstract

A ladder is a 2xk grid graph. When does a graph class C exclude some ladder as a minor? We show that this is the case if and only if all graphs G in C admit a proper vertex coloring with a bounded number of colors such that for every 2-connected subgraph H of G, there is a color that appears exactly once in H. This type of vertex coloring is a relaxation of the notion of centered coloring, where for every connected subgraph H of G, there must be a color that appears exactly once in H. The minimum number of colors in a centered coloring of G is the treedepth of G, and it is known that classes of graphs with bounded treedepth are exactly those that exclude a fixed path as a subgraph, or equivalently, as a minor. In this sense, the structure of graphs excluding a fixed ladder as a minor resembles the structure of graphs without long paths. Another similarity is as follows: It is an easy observation that every connected graph with two vertex-disjoint paths of length k has a path of length k + 1. We show that every 3-connected graph which contains as a minor a union of sufficiently many vertex-disjoint copies of a 2 x k grid has a 2x(k + 1) grid minor.Our structural results have applications to poset dimension. We show that posets whose cover graphs exclude a fixed ladder as a minor have bounded dimension. This is a new step towards the goal of understanding which graphs are unavoidable as minors in cover graphs of posets with large dimension.
##### Scheda breve Scheda completa
2022
Graph; graph minor; ladder; treedepth; poset dimension
01 Pubblicazione su rivista::01a Articolo in rivista
Excluding a Ladder / Huynh, T.; Joret, G.; Micek, P.; Seweryn, M. T.; Wollan, P.. - In: COMBINATORICA. - ISSN 0209-9683. - 42:3(2022), pp. 405-432. [10.1007/s00493-021-4592-8]
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/11573/1676264`
##### Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

• ND
• 0
• 0