Question) Let $G$ be a graph with $2$ spanning trees.
Now we try $K_4$
Now I'm just trying to find if any two trees can be disjoint
managed to find two after writing them all down. Therefore the least number of edge-disjoint spanning trees is a graph of $4$ vertices.
Is this right?
Is there an easier way to show this? Mainly had trouble finding all the disjoint spanning trees