The order dimension of the complete graph

DOI10.1016/S0012-365X(98)00315-XzbMath0932.06003OpenAlexW2090638798WikidataQ29037380 ScholiaQ29037380MaRDI QIDQ1301733

Serkan Hoşten, Walter D. jun. Morris

Publication date: 12 December 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00315-x

zbMATH Keywords

antichainscomplete graphorder dimensionsubset lattice

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Graph theory (05C99)

Related Items

Forcing posets with large dimension to contain large standard examples ⋮ Dimension of restricted classes of interval orders ⋮ Robinsonian matrices: recognition challenges ⋮ Dimension of CPT posets ⋮ Chromatic numbers of copoint graphs of convex geometries ⋮ Dushnik-Miller dimension of TD-Delaunay complexes ⋮ Monomial Tropical Cones for Multicriteria Optimization ⋮ Counting families of mutually intersecting sets ⋮ Orthogonal surfaces and their CP-orders ⋮ A note on the orientation covering number ⋮ On the minimum number of completely 3-scrambling permutations ⋮ Coloring copoints of a planar point set ⋮ Incidence posets and cover graphs ⋮ On multipartite posets ⋮ Average behavior of minimal free resolutions of monomial ideals ⋮ On Covering Numbers, Young Diagrams, and the Local Dimension of Posets ⋮ Comparing Dushnik-Miller dimension, Boolean dimension and local dimension ⋮ The maximum number of edges in a graph of bounded dimension, with applications to ring theory

Cites Work

• Planar graphs and poset dimension
• A computation of the eighth Dedekind number
• The number of outside corners of monomial ideals
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Minimal scrambling sets of simple orders
• Concerning a Certain Set of Arrangements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item