On the order dimension of 1-sets versus k-sets
From MaRDI portal
zbMATH Open0834.06004MaRDI QIDQ1906136FDOQ1906136
Publication date: 31 March 1996
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The dimension of random ordered sets
- Minimal scrambling sets of simple orders
- Concerning a Certain Set of Arrangements
- On the dimensions of ordered sets of bounded degree
- The dimension of suborders of the Boolean lattice
- The dimension of interior levels of the Boolean lattice
Cited In (21)
- The order dimension of divisibility
- On the minimum number of completely 3-scrambling permutations
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- Boolean layer cakes
- Infinite combinatorial issues raised by lifting problems in universal algebra
- Separation dimension of graphs and hypergraphs
- The dimension of interior levels of the Boolean lattice
- The fractional dimension of subsets of Boolean lattices and cartesian products
- Dimensions of hypergraphs
- Fractional local dimension
- The dimension of two levels of the Boolean lattice
- Suitable Permutations, Binary Covering Arrays, and Paley Matrices
- A lower bound for families of Natarajan dimension \(d\)
- Improved bounds for the dimension of divisibility
- Computational aspects of the 2-dimension of partially ordered sets
- An infinite combinatorial statement with a poset parameter
- Better bounds for poset dimension and boxicity
- The dimension of divisibility orders and multiset posets
- Constructions and nonexistence results for suitable sets of permutations
- The dimension of interior levels of the Boolean lattice. II
- One-dimensional central measures on numberings of ordered sets
This page was built for publication: On the order dimension of 1-sets versus \(k\)-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906136)
