Dimension of posets with planar cover graphs excluding two long incomparable chains
From MaRDI portal
Publication:1734698
DOI10.1016/j.jcta.2018.11.016zbMath1407.05067arXiv1608.08843OpenAlexW2515403108WikidataQ128737588 ScholiaQ128737588MaRDI QIDQ1734698
Noah Streib, David M. Howard, Bartosz Walczak, William T. jun. Trotter, Rui Dong Wang
Publication date: 27 March 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08843
Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (3)
On the transitivity coefficients for minimal posets with nonpositive quadratic Tits form ⋮ Comparing Dushnik-Miller dimension, Boolean dimension and local dimension ⋮ Excluding a ladder
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forcing posets with large dimension to contain large standard examples
- Posets with cover graph of pathwidth two have bounded dimension
- Planar posets, dimension, breadth and the number of minimal elements
- Minors and dimension
- An extremal problem on crossing vectors.
- First-Fit is linear on posets excluding two long incomparable chains
- The dimension of planar posets
- A bound on the dimension of interval orders
- Dimension, graph and hypergraph coloring
- On-line dimension for posets excluding two long incomparable chains
- Interval orders and dimension
- Nowhere dense graph classes and dimension
- The dimension of posets with planar cover graphs.
- Tree-width and dimension
- On the dimension of posets with cover graphs of treewidth 2
- Dimension and height for posets with planar cover graphs.
- Intransitive indifference with unequal indifference intervals
- First-Fit Algorithm for the On-Line Chain Partitioning Problem
- Sparsity and dimension
- Topological Minors of Cover Graphs and Dimension
- Planar Posets Have Dimension at Most Linear in Their Height
- Dimension and Cut Vertices: An Application of Ramsey Theory
- An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains
- Partially Ordered Sets
- On the dimension of partially ordered sets
This page was built for publication: Dimension of posets with planar cover graphs excluding two long incomparable chains