Possible Duplicate:
Spanning Trees of the Complete Graph Avoiding a Given Tree
Two edges $\{a,b\}, \{c,d\}$ are crossing if $a
How many non crossing spanning trees in $K_n$ exist which contain a given edge? The idea of letting two trees grow from the vertices of the fixed edge doesn't guarantee that the resulting tree is non-crossing.