Incidence posets of trees in posets of large dimension
type: Item
instance of: scholarly article
title: Incidence posets of trees in posets of large dimension
zbMATH Open document ID: 0823.06005
DOI: 10.1007/BF01108600
published in: Order
publication date: 1994-12-18T00:00:00Z
review text: The principal result of this paper is the following theorem: For each positive integer \(n\), if \(T\) is a tree on \(n\) vertices and if \(P\) is any poset having dimension at least \(4n^ 6\), then either \(P\) or its dual contains the incidence poset of \(T\) as a suborder.
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 695772
zbMATH Keywords: partially ordered set
zbMATH Keywords: dimension
zbMATH Keywords: incidence poset
zbMATH Keywords: suborder
zbMATH Keywords: tree
author: Graham Brightwell
author: William T. Trotter
reviewed by: Thomas B. Muenzenberger
MaRDI profile type: Publication
cites work: Random high-dimensional orders
cites work: A bound on the dimension of interval orders
cites work: Fractional dimension of partial orders
cites work: The dimension of random ordered sets
cites work: Q3137188
cites work: On the dimensions of ordered sets of bounded degree
cites work: Planar graphs and poset dimension
cites work: Minimal scrambling sets of simple orders
cites work: Q3672006
cites work: Q4871756
cites work: Q3815303
cites work: Q4326649
cites work: Q4004146
description: scientific article; zbMATH DE number 695772