Name
Abstract | ||
|---|---|---|
The dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a variation called local dimension which makes use of partial linear extensions. While local dimension is bounded above by dimension, they can be arbitrarily far apart as the dimension of the standard example is n while its local dimension is only 3. Hiraguchi (1955) proved that the maximum dimension of a poset of order n is n∕2. However, we find a very different result for local dimension, proving a bound of Θ(n∕logn). This follows from connections with covering graphs using difference graphs which are bipartite graphs whose vertices in a single class have nested neighborhoods. We also prove that the local dimension of the n-dimensional Boolean lattice is Ω(n∕logn) and make progress toward resolving an analogue of the removable pair conjecture for local dimension. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejc.2019.103074 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Binary logarithm,Combinatorics,Vertex (geometry),Bounded set,Bipartite graph,Omega,Boolean algebra (structure),Conjecture,Partially ordered set,Mathematics | Journal | 86 |
ISSN | Citations | PageRank |
0195-6698 | 0 | 0.34 |
References | Authors | |
2 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinha Kim | 1 | 0 | 0.34 |
| Ryan R. Martin | 2 | 36 | 10.12 |
| Tomáš Masařík | 3 | 6 | 6.97 |
| Warren Shull | 4 | 0 | 0.34 |
| Heather Smith | 5 | 1 | 3.16 |
| Andrew J. Uzzell | 6 | 13 | 4.48 |
| Zhiyu Wang | 7 | 16 | 8.50 |