arXiv Analytics

Sign in

arXiv:1504.07388 [math.CO]AbstractReferencesReviewsResources

Topological minors of cover graphs and dimension

Piotr Micek, Veit Wiechert

Published 2015-04-28Version 1

We introduce new tools to tackle problems involving upper bounds on poset dimension. Using these tools we prove two results: (1) Posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension; (2) The $(k+k)$-free posets whose cover graphs exclude a fixed graph as a topological minor contain only standard examples of size bounded in terms of $k$. The first result was already given by Walczak. Our argument is very different, elementary, and in particular does not rely on structural decomposition theorems. The second result supports a conjectured generalization of the first result for $(k+k)$-free posets.

Related articles: Most relevant | Search more
arXiv:1003.4728 [math.CO] (Published 2010-03-24, updated 2010-07-13)
n! matchings, n! posets
arXiv:2002.01297 [math.CO] (Published 2020-02-04)
Induced Ramsey number for a star versus a fixed graph
arXiv:1006.1226 [math.CO] (Published 2010-06-07, updated 2010-06-16)
On a conjecture about enumerating $(2+2)$-free posets