Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Are all maximal subtrees of a simple connected graph isomorphic? any hints?

share|cite|improve this question
up vote 3 down vote accepted

The answer is a resounding "No". Even as small as the complete graph on four vertices, one can find nonisomorphic spanning trees.

enter image description here enter image description here

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.)

share|cite|improve this answer
Thanks, a lot, for the link too, it seems interesting. I will have a look – StudentMath Oct 11 '12 at 0:02

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.