# Seymour's self-minor conjecture

From Egres Open

Every countably infinite graph is a proper minor of itself.

## Remarks

Seymour originally conjectured this for any infinite graph, but it turned out to be false ^{[1]}. On the other hand, it is known to be true for infinite trees of any size ^{[2]}. See also Seymour's self-minor conjecture on the Open Problem Garden.