A forbidden subposet characterization of an order — dimension inequality
From MaRDI portal
Publication:4121940
DOI10.1007/BF01683266zbMATH Open0352.06002OpenAlexW2115698964MaRDI QIDQ4121940FDOQ4121940
Publication date: 1976
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01683266
Cites Work
- Title not available (Why is that?)
- Partially Ordered Sets
- Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
- Inequalities in Dimension Theory for Posets
- Title not available (Why is that?)
- Dimension of the crown \(S^k_n\)
- Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
Cited In (7)
- The dimension of the Cartesian product of partial orders
- The Hardness of Approximating Poset Dimension
- On the fractional dimension of partially ordered sets
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Dimension and matchings in comparability and incomparability graphs.
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
- Some theorems on graphs and posets
This page was built for publication: A forbidden subposet characterization of an order — dimension inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121940)