A proof of the rooted tree alternative conjecture
Combinatorics
2011-02-24 v1
Abstract
Bonato and Tardif 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 discuss the original conjecture for locally finite trees and state some new conjectures.
Cite
@article{arxiv.0812.1121,
title = {A proof of the rooted tree alternative conjecture},
author = {Mykhaylo Tyomkyn},
journal= {arXiv preprint arXiv:0812.1121},
year = {2011}
}