Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Kuratowski and Wagner theorems characterize planar graphs in terms of forbidden homeomorphic subgraphs and forbidden minors, respectively. It turns out that both forbidden sets are the same: $\{K_5,K_{3,3}\}$.

Are there other examples where a forbidden set defines the same class of graphs in both ways?

share|improve this question

1 Answer 1

up vote 5 down vote accepted

One example that springs to mind: A (simple) graph is a forest iff it has no $K_3$ as a minor, and also iff it has no $K_3$ as a topological minor (homeomorphic subgraph).

More generally, if the forbidden graphs have maximum degree 3, there's no difference between minors and topological minors (see Proposition 1.7.4 in Diestel's textbook).

share|improve this answer
    
Thank you! that prop. wasn't there in the 3rd edition. –  Diego Nov 8 '11 at 19:23

Your Answer

 
discard

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.