Inequalities in Dimension Theory for Posets
From MaRDI portal
Publication:4073407
DOI10.2307/2039736zbMath0314.06001OpenAlexW4253734789MaRDI QIDQ4073407
Publication date: 1975
Full work available at URL: https://doi.org/10.2307/2039736
Related Items
Decomposing weighted digraphs into sums of chains, Forcing posets with large dimension to contain large standard examples, On the fractional dimension of partially ordered sets, Segment orders, Representing an ordered set as the intersection of super greedy linear extensions, The small inductive dimension of finite lattices through matrices, A characterization of two-agent Pareto representable orderings, The proof of the removable pair conjecture for fractional dimension., A combinatorial problem involving graphs and matrices, On difference graphs and the local dimension of posets, A forbidden subposet characterization of an order — dimension inequality, Utility representation of an incomplete preference relation, The dimension of planar posets, A generalization of Hiraguchi's: Inequality for posets, Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension, On the complexity of posets, Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Dimension and matchings in comparability and incomparability graphs., A study of the order dimension of a poset using matrices, Comparing Dushnik-Miller dimension, Boolean dimension and local dimension, Inequalities for the greedy dimensions of ordered sets, The Dimension of a Comparability Graph
Cites Work
- Unnamed Item
- Irreducible posets with large height exist
- Dimension of the crown \(S^k_n\)
- Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
- Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
- A decomposition theorem for partially ordered sets
- Partially Ordered Sets
