Title of article
Bounds on trees
Author/Authors
Soki?، نويسنده , , Miodrag، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
10
From page
398
To page
407
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 , Partition , Strong subtree
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1599579
Link To Document