[n] is at least p(n) (the number of partitions of the integer ve that in any tree T, any two longest paths cross each oth ve that in any tree T all longest paths cross one another