Stacks and splits of partially ordered sets

DOI10.1016/0012-365X(81)90211-9zbMATH Open0476.06002MaRDI QIDQ1160199FDOQ1160199

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

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

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)