# Question: let kn v e be a complete undirected graph...

###### Question details

Let Kn = (V, E) be a complete undirected graph with n vertices (namely, every two vertices are connected), and let n be an even number. Design a recursive algorithm that given the graph Kn , partitions the set of edges E into n/2 distinct subsets E1 , E2 , ..., En/2 , such that for every subset Ei , the subgraph Gi = (V, Ei ) is a spanning tree of Kn .