We prove that every poset with bounded cliquewidth and with sufficiently large dimension
contains the standard example of dimension k as a subposet. This applies in particular to …

A ladder is a 2× k grid graph. When does a graph class\cal CC exclude some ladder as a
minor? We show that this is the case if and only if all graphs G in\cal CC admit a proper …

Dimension is one of the most important measures of complexity for posets. The dimension of
a poset is defined as the least positive integer d such that the partial order of the poset is the …

Over the past 10 years, there has been considerable interest in exploring questions
connecting dimension for posets with graph theoretic properties of their cover graphs and …