# Robertson-Seymour theorem

> English word · Proper noun

## Definitions
1. A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.

## Etymology
Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.

## Source
Compiled from Wiktionary via kaikki.org (CC BY-SA). Data vintage: 2026-05-06.
Canonical page: https://plainspell.com/en/word/robertson-seymour-theorem