Cites work
- A Note on Dilworth's Embedding Theorem
- A decomposition theorem for partially ordered sets
- A forbidden subposet characterization of an order — dimension inequality
- Arbres et dimension des ordres
- Concerning a Certain Set of Arrangements
- Dimension of the crown \(S^k_n\)
- 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
- The dimension of planar posets
Cited in
(14)- Infinitely many trees have non-Sperner subtree poset
- Dimension of CPT posets
- The dimension of planar posets
- Well-quasi-ordering and Embeddability of Relational Structures
- Large Minimal Realizers of a Partial Order
- The poset on connected induced subgraphs of a graph need not be Sperner
- Planar posets, dimension, breadth and the number of minimal elements
- Greedy trees, subtrees and antichains
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- On containment graphs of paths in a tree
- On the local and global means of subtree orders
- The poset of unlabeled induced subgraphs of a finite graph
- Recent results on containment graphs of paths in a tree
- The system of abstract connected subgraphs of a linear graph
This page was built for publication: Some theorems on graphs and posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1223323)
