Infinitely Many Trees Have Non-Sperner Subtree Poset

Andrew Vince, Hua Wang

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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.
Original languageAmerican English
JournalOrder
Volume24
DOIs
StatePublished - May 2007

Keywords

  • Non-sperner subtree poset
  • Trees

DC Disciplines

  • Mathematics

Fingerprint

Dive into the research topics of 'Infinitely Many Trees Have Non-Sperner Subtree Poset'. Together they form a unique fingerprint.

Cite this