Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649599 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
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 TT 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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mykhaylo Tyomkyn,