I have read some paper claim about graph-minor theorem that "Another equivalent form of the theorem is that, in any infinite set S of graphs, there must be a pair of graphs one of which is a minor of the other." So does it mean that graphs considered are infinitely large? Because in many papers Seymour stresses that they are talking about finite graphs, this confuses me.
Alternative interpretation of graph-minor theorem
1
$\begingroup$
graph-theory