机构:
Univ Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, EnglandUniv Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
Tyomkyn, Mykhaylo
[1
]
机构:
[1] Univ Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
Bonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative conjecture, J. Combinatorial Theory, Series B 96 (2006), 874-880] conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or infinite. We prove the analogue of their conjecture for rooted trees. We also make some progress towards the original conjecture for locally finite trees and state some new conjectures. (C) 2009 Elsevier B.V. All rights reserved.
机构:
Sun Yat Sen Univ, Sch Math Zhuhai, Zhuhai 519082, Guangdong, Peoples R ChinaSun Yat Sen Univ, Sch Math Zhuhai, Zhuhai 519082, Guangdong, Peoples R China