In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a forest, or equivalently, has treewidth at most 1. On the other hand, a well-known construction of Kelly shows that there are posets of arbitrarily large dimension whose cover graphs have treewidth 3. In this paper we focus on the boundary case of treewidth 2. It was recently shown that the dimension is bounded if the cover graph is outerplanar (Felsner, Trotter, and Wiechert) or if it has pathwidth 2 (Biró, Keller, and Young). This can be interpreted as evidence that the dimension should be bounded more generally when the cover graph has treewidth 2. We show that it is indeed the case: Every such poset has dimension at most 1276
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
Abstract. In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover ...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
The goal of this dissertation is to study the various connections between the dimension of posets an...
if there exists a constant d such that if P is a poset with cover graph of P of pathwidth at most 2,...
Abstract. Over the last 30 years, researchers have investigated connections between dimension for po...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We show that height $h$ posets that have planar cover graphs have dimension $\mathcal{O}(h^6)$. Prev...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
Abstract. In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover ...
In 1977, Trotter and Moore proved that a poset has dimension at most 3 whenever its cover graph is a...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
The goal of this dissertation is to study the various connections between the dimension of posets an...
if there exists a constant d such that if P is a poset with cover graph of P of pathwidth at most 2,...
Abstract. Over the last 30 years, researchers have investigated connections between dimension for po...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
We show that height $h$ posets that have planar cover graphs have dimension $\mathcal{O}(h^6)$. Prev...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets i...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...