Skip to main content
Log in

Infinitely Many Trees Have Non-Sperner Subtree Poset

  • Published:
Order Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Dilworth, R.P., Crawley, P.: Decomposition theory for lattices without chain conditions. Trans. Amer. Math. Soc. 96, 1–22 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  2. Jacobson, M.S., Kézdy, A., Seif, S.: The poset on connected induced subgraphs of a graph need not be Sperner. Order 12, 315–318 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Klavzar, S., Petkovsek, M., Steelman, J.H.: Problems and solutions, solutions of elementary problems, E3281. Amer. Math. Monthly 97, 924–925 (1990)

    Article  MathSciNet  Google Scholar 

  4. Trotter, W.T., Moore, J.L.: Some theorems on graphs and posets. Discrete Math. 15, 79–84 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  5. West, D.B.: Open problems. In: Newsletter of the Siam Activity Group on Discrete Mathematics, Spring, vol. 2 series 2 (1992)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hua Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vince, A., Wang, H. Infinitely Many Trees Have Non-Sperner Subtree Poset. Order 24, 133–138 (2007). https://doi.org/10.1007/s11083-007-9064-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-007-9064-2

Keywords

Navigation