Skip to main content
Article
Infinitely Many Trees Have Non-Sperner Subtree Poset
Order (2007)
  • Andrew Vince, University of Florida
  • Hua Wang, Georgia Southern University
Abstract
Let C(T) denote the poset of subtrees of a tree T with respect to the inclusion ordering. Jacobson, Kézdy and Seif gave a single example of a tree T for which C(T) is not Sperner, answering a question posed by Penrice. The authors then ask whether there exist an infinite family of trees T such that C(T) is not Sperner. This paper provides such a family.
Keywords
  • Trees,
  • Non-sperner subtree poset
Disciplines
Publication Date
May, 2007
DOI
10.1007/s11083-007-9064-2
Citation Information
Andrew Vince and Hua Wang. "Infinitely Many Trees Have Non-Sperner Subtree Poset" Order Vol. 24 Iss. 2 (2007) p. 133 - 138 ISSN: 1572-9273
Available at: http://works.bepress.com/hua_wang/143/