Bounds on trees

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We prove a finitary version of the HalpernLuchli Theorem. We also prove partition results about strong subtrees. Both results give estimates on the height of trees. © 2011 Elsevier B.V.

Author supplied keywords

Cite

CITATION STYLE

APA

Sokić, M. (2011). Bounds on trees. Discrete Mathematics, 311(6), 398–407. https://doi.org/10.1016/j.disc.2010.12.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free