Are all maximal subtrees of a simple connected graph isomorphic? any hints?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
The answer is a resounding "No". Even as small as the complete graph on four vertices, one can find nonisomorphic spanning trees.
The number of nonisomorphic trees grows reasonably quickly after that. For example, the complete graph on ten vertices has 106 nonisomorphic spanning trees.
(Incidentally, here is a small collection of spanning trees you might find interesting.)