Incidence posets of trees in posets of large dimension
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.
scientific article; zbMATH DE number 695772