|
|||||
|
|
Bounds on trees |
|
| Authors: | Miodrag Soki? |
| Affiliation: | aDepartment of Mathematics, California Institute of Technology, Pasadena, CA 91125, United States |
| 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. |
| Keywords: | Tree Strong subtree Partition |
| 本文献已被 ScienceDirect 等数据库收录！ | |