On the complexity of posets

DOI10.1016/0012-365X(76)90095-9MaRDI QIDQ1235192zbMATH OpenOpenAlexFDO

Authors William T. Trotter, Kenneth P. Bogart

Publication date 1976

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(76)90095-9

Mathematics Subject Classification ID

Partial orders, general (06A06)

Cites work

• A bound on the dimension of interval orders
• A decomposition theorem for partially ordered sets
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Dimension of the crown \(S^k_n\)
• Foundational aspects of theories of measurement
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3318593 (Why is no real title available?)
• Inequalities in Dimension Theory for Posets
• Intransitive indifference with unequal indifference intervals
• Irreducible posets with large height exist
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
• Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
• Natural Partial Orders
• The dimension of planar posets
• The dimension of semiorders

Cited in

(22)

• On realizable biorders and the biorder dimension of a relation
• The dimension of the Cartesian product of partial orders
• On the separation of two relations by a biorder or a semiorder
• A construction for partially ordered sets
• Stacks and splits of partially ordered sets
• The dimension of planar posets
• Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Split semiorders
• Algorithms constructing a representive vector criterion for a binary preference relation
• Generalizations of semiorders: A review note
• A recognition algorithm for orders of interval dimension two
• A min-max property of chordal bipartite graphs with applications
• The Complexity of the Partial Order Dimension Problem
• Maximum Semiorders in Interval Orders
• On incomplete preference structures
• Dimension and matchings in comparability and incomparability graphs.
• Dimensions of hypergraphs
• Angle orders
• The relationship between the threshold dimension of split graphs and various dimensional parameters
• Interval dimension is a comparability invariant
• Adjacency posets of planar graphs

This page was built for publication: On the complexity of posets

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