Some theorems on graphs and posets

DOI10.1016/0012-365X(76)90111-4zbMath0322.06002MaRDI QIDQ1223323

William T. jun. Trotter, John I. jun. Moore

Publication date: 1976

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

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (05C99)

Related Items (13)

Large Minimal Realizers of a Partial Order ⋮ Planar posets, dimension, breadth and the number of minimal elements ⋮ On containment graphs of paths in a tree ⋮ On the Local and Global Means of Subtree Orders ⋮ The poset on connected induced subgraphs of a graph need not be Sperner ⋮ Dimension of CPT posets ⋮ Greedy trees, subtrees and antichains ⋮ Infinitely many trees have non-Sperner subtree poset ⋮ Recent results on containment graphs of paths in a tree ⋮ The dimension of planar posets ⋮ Characterization problems for graphs, partially ordered sets, lattices, and families of sets ⋮ The poset of unlabeled induced subgraphs of a finite graph ⋮ Unnamed Item

Cites Work

• The dimension of planar posets
• Dimension of the crown \(S^k_n\)
• Arbres et dimension des ordres
• Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
• Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
• A decomposition theorem for partially ordered sets
• A Note on Dilworth's Embedding Theorem
• A forbidden subposet characterization of an order — dimension inequality
• Concerning a Certain Set of Arrangements

This page was built for publication: Some theorems on graphs and posets