Do any two spanning trees of a simple graph always have some common edges?
-
05-11-2019 - |
Question
I tried few cases and found any two spanning tree of a simple graph has some common edges. I mean I couldn't find any counter example so far. But I couldn't prove or disprove this either. How to prove or disprove this conjecture?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange