Stacks and splits of partially ordered sets

DOI10.1016/0012-365X(81)90211-9zbMath0476.06002MaRDI QIDQ1160199

William T. jun. Trotter

Publication date: 1981

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

zbMATH Keywords

stackinterval dimensioncritical non interval-representable familiesdisconnected interval orderirreducible posetsposets of height onet-interval irreducible poset

Mathematics Subject Classification ID

Partial orders, general (06A06)

Related Items (6)

3-interval irreducible partially ordered sets ⋮ Recent results on containment graphs of paths in a tree ⋮ Dimensions of hypergraphs ⋮ Computing the dimension of N-free ordered sets is NP-complete ⋮ Split semiorders ⋮ Chordal bipartite graphs and crowns

Cites Work

• Unnamed Item
• A characterization of Robert's inequality for boxicity
• Dimension of the crown \(S^k_n\)
• On the complexity of posets
• A bound on the dimension of interval orders
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Intransitive indifference with unequal indifference intervals
• The 3-Irreducible Partially Ordered Sets
• Transitiv orientierbare Graphen

This page was built for publication: Stacks and splits of partially ordered sets