# Tag Info

Accepted

### Do any two spanning trees of a simple graph always have some common edges?

No, consider the complete graph $K_4$: It has the following edge-disjoint spanning trees:
Accepted

• 17.7k