Stacks and splits of partially ordered sets

DOI10.1016/0012-365X(81)90211-9MaRDI QIDQ1160199zbMATH OpenFDO

Authors William T. 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)

Cites work

• scientific article; zbMATH DE number 3825834 (Why is no real title available?)
• A bound on the dimension of interval orders
• A characterization of Robert's inequality for boxicity
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Dimension of the crown \(S^k_n\)
• Intransitive indifference with unequal indifference intervals
• On the complexity of posets
• The 3-Irreducible Partially Ordered Sets
• Transitiv orientierbare Graphen

Cited in

(6)

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

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

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