Graph Minor Theorem

Graph Minor Theorem --- теорема о графовых минорах.

Theorem (Robertson, Seymour). For every minor closed class [math]\displaystyle{ \mathcal{C} }[/math] of graphs, there is a finite set [math]\displaystyle{ \mathcal{F} }[/math] of graphs such that

[math]\displaystyle{ \mathcal{C} = \{G| \; \forall H \in \mathcal{F} : H \not \preceq G\}. }[/math]