The dimension of two levels of the Boolean lattice

DOI10.1016/S0012-365X(98)00316-1MaRDI QIDQ1301734zbMATH OpenOpenAlexFDO

Authors H. A. Kierstead

Publication date 12 September 1999

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Boolean latticedimensionpartially orderd setsurvey

Mathematics Subject Classification ID

Extremal set theory (05D05) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02) Combinatorics of partially ordered sets (06A07)

Review text

This paper is a survey article on results and proof techniques concerning the dimension of the ordered set obtained by ordering the \(j\)-element and \(k\)-element subsets of an \(n\)-element set by inclusion.

Recommendations

• The order dimension of two levels of the Boolean lattices
• The dimension of interior levels of the Boolean lattice
• The dimension of suborders of the Boolean lattice

Cites work

• Combinatorial set theory: Partition relations for cardinals
• Concerning a Certain Set of Arrangements
• Minimal scrambling sets of simple orders
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• On the dimensions of ordered sets of bounded degree
• On the order dimension of 1-sets versus k-sets
• Set theory. An introduction to independence proofs
• The dimension of interior levels of the Boolean lattice
• The dimension of suborders of the Boolean lattice
• The dimension of the finite subsets of
• The order dimension of two levels of the Boolean lattices

Cited in

(13)

• The dimension of neighboring levels of the Boolean lattice
• The maximum number of edges in a graph of bounded dimension, with applications to ring theory
• The order dimension of two levels of the Boolean lattices
• The dimension of interior levels of the Boolean lattice
• The dimension of interior levels of the Boolean lattice. II
• On the boxicity of Kneser graphs and complements of line graphs
• Infinite combinatorial issues raised by lifting problems in universal algebra
• On covering numbers, Young diagrams, and the local dimension of posets
• Improved bounds for the dimension of divisibility
• An infinite combinatorial statement with a poset parameter
• The dimension of divisibility orders and multiset posets
• Boolean dimension of a Boolean lattice
• Word-representation numbers of graphs: bottlenecks and bounds

This page was built for publication: The dimension of two levels of the Boolean lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301734)