120
click to vote
EJC
2010
15 years 3 months ago
2010
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...