Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n

DOI10.1016/0012-365X(73)90025-3zbMath0262.06002MaRDI QIDQ2560838

Kenneth P. Bogart, William T. jun. Trotter

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15)

Related Items

Forcing posets with large dimension to contain large standard examples ⋮ On the fractional dimension of partially ordered sets ⋮ Large chromatic number and Ramsey graphs ⋮ A combinatorial problem involving graphs and matrices ⋮ A forbidden subposet characterization of an order — dimension inequality ⋮ Dimension of the crown \(S^k_n\) ⋮ Arbres et dimension des ordres ⋮ Some theorems on graphs and 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 ⋮ A bound on the dimension of interval orders ⋮ Dimension and matchings in comparability and incomparability graphs. ⋮ Fractional dimension of partial orders ⋮ Inequalities in Dimension Theory for Posets ⋮ On realizable biorders and the biorder dimension of a relation ⋮ Standard examples as subposets of posets.

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• A decomposition theorem for partially ordered sets
• Partial orders of dimension 2
• A Characterization of Comparability Graphs and of Interval Graphs
• Partially Ordered Sets
• On the Dimension of Partially Ordered Sets