It is well known that the finite rooted trees are well-quasi-ordered by the topological minor relation (a.k.a. homeomorphic embedding). Are they also wqo by the (induced) subgraph relation?
I'm confused because it seems to me that Nash-Williams proof can easily be adapted to induced subgraphs. This would be a stronger (and simpler) result.
Does anyone know a bad sequence?