| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648683 | Discrete Mathematics | 2011 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Miodrag Sokić,