Bonato–Tardif rooted tree alternative conjecture

A rooted tree (T,r)(T,r) is a tree TT with a distinguished vertex rr. Two rooted trees (T,r)(T,r) and (T,r)(T',r') are twins, or mutually embeddable, when there are injective graph homomorphisms ϕ ⁣:TT\phi \colon T \rightarrow T' and ψ ⁣:TT\psi \colon T' \rightarrow T satisfying ϕ(r)=r\phi(r)=r' and ψ(r)=r\psi(r')=r. Let m(T,r)m(T,r) be the number of isomorphism classes of rooted trees (T,r)(T',r') mutually embeddable with (T,r)(T,r). Rooted tree alternative conjecture. Every rooted tree (T,r)(T,r) has twin number either 11 or \infty.

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.

Sources & referencesView supporting material

Primary source

Mykhaylo Tyomkyn, “A proof of the rooted tree alternative conjecture”, arXiv:0812.1121 (2008).

Progress summary

Never refreshed

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.