I have come across a question based on spanning tree i.e :
what is the upper bound on the number of edge disjoint spanning trees in a
complete graph of n vertices?
(a) n (b) n-1
(c) [n/2] (d) [n/3]
what do we mean by edge disjoint spanning trees? Does that mean different trees such that they don't have any same edges in all the trees?as disjoint means nothing common. Please explain and also what should be its answer then?