- #1
Gh0stZA
- 25
- 0
Hi everyone,
Any help would be appreciated.
Let F be a subgraph of a connected graph G. Prove that F is a subgraph of every spanning tree of G iff F contains no cycles.
Any help would be appreciated.