On the order dimension of 1-sets versus \(k\)-sets

zbMath0834.06004MaRDI QIDQ1906136

Henry A. Kierstead

Publication date: 31 March 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

upper boundsBoolean latticelower boundsorder dimension

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items (15)

Computational aspects of the 2-dimension of partially ordered sets ⋮ Separation dimension of graphs and hypergraphs ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Improved bounds for the dimension of divisibility ⋮ Infinite combinatorial issues raised by lifting problems in universal algebra ⋮ An infinite combinatorial statement with a poset parameter ⋮ The order dimension of divisibility ⋮ Constructions and nonexistence results for suitable sets of permutations ⋮ On the minimum number of completely 3-scrambling permutations ⋮ Suitable sets of permutations, packings of triples, and Ramsey's theorem ⋮ Fractional local dimension ⋮ Better bounds for poset dimension and boxicity ⋮ Boolean layer cakes ⋮ The dimension of two levels of the Boolean lattice ⋮ The fractional dimension of subsets of Boolean lattices and cartesian products

Cites Work

• Unnamed Item
• Unnamed Item
• On the dimensions of ordered sets of bounded degree
• The dimension of interior levels of the Boolean lattice
• The dimension of suborders of the Boolean lattice
• The dimension of random ordered sets
• Minimal scrambling sets of simple orders
• Concerning a Certain Set of Arrangements

This page was built for publication: On the order dimension of 1-sets versus \(k\)-sets