Sharp upper and lower bounds on a restricted class of convex characters

Steven Kelk, Ruben Meuwese

Let $\mathcal{T}$ be an unrooted binary tree with $n$ distinctly labelled leaves. Deriving its name from the field of phylogenetics, a convex character on $\mathcal{T}$ is simply a…