Published March 28, 2011
| public
Journal Article
Bounds on trees
- Creators
- Sokić, Miodrag
Abstract
We prove a finitary version of the Halpern–Läuchli Theorem. We also prove partition results about strong subtrees. Both results give estimates on the height of trees.
Additional Information
© 2010 Elsevier B.V. Received 29 December 2009; revised 29 November 2010; accepted 1 December 2010. Available online 28 December 2010. The author thanks the referees for their careful reading and many valuable comments and suggestions.Additional details
- Eprint ID
- 23050
- Resolver ID
- CaltechAUTHORS:20110322-113119891
- Created
-
2011-03-22Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field