Bonato–Tardif rooted tree alternative conjecture
A rooted tree is a tree with a distinguished vertex . Two rooted trees and are twins, or mutually embeddable, when there are injective graph homomorphisms and satisfying and . Let be the number of isomorphism classes of rooted trees mutually embeddable with . Rooted tree alternative conjecture. Every rooted tree has twin number either or .
The source says that this was implicitly conjectured by Bonato and Tardif. It is the rooted analogue of the tree alternative conjecture and is proved in the paper.
References
Primary source
Mykhaylo Tyomkyn, “A proof of the rooted tree alternative conjecture”, arXiv:0812.1121 (2008).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.