Etymology

Robertson-Seymour theorem

Today it means: A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering. Full definition →

Ask AI about its historyChatGPTClaudePerplexityGoogle AIGrok

The story

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

Etymology from Wiktionary, CC BY-SA 4.0.