Robertson–Seymour theorem - Google Search (original) (raw)

• Any time

• Past hour

• Past 24 hours

• Past week

• Past month

• Past year

• All results

• Verbatim

Robertson–Seymour theorem

In graph theory, the Robertson–Seymour theorem states that the undirected graphs, partially ordered by the graph minor relationship, form a well-quasi-ordering. Wikipedia