1 citations · 1 across the 1 of their papers we have counts for
1 paper
Dávid Matolcsi, Zoltán Lóránt Nagy
We prove an asymptotic result on the maximum number of k-vertex subtrees in binary trees of given order. This problem turns out to be equivalent to determine the maximum number of…