Meanings
proper nounthe Robertson-Seymour theorem
- graph theoryA theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
Origin
Named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of papers from 1983 to 2004.
Full word history & related roots →Cite this entry
APA
Robertson-Seymour theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/Robertson-Seymour%20theorem
MLA
“Robertson-Seymour theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Robertson-Seymour%20theorem. Accessed November 5, 2026.
Chicago
WatkinsX Dictionary, s.v. “Robertson-Seymour theorem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/Robertson-Seymour%20theorem.
Source: Robertson-Seymour theorem on Wiktionary, CC BY-SA 4.0.