Definitions from Wiktionary (Robertson-Seymour theorem)
▸ noun: (graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
▸ Words similar to robertson-seymour theorem
▸ Usage examples for robertson-seymour theorem
▸ Idioms related to robertson-seymour theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near robertson-seymour theorem
▸ Rhymes of robertson-seymour theorem
▸ Invented words related to robertson-seymour theorem
▸ noun: (graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
Similar:
strict ordering,
Ramsey's theorem,
order,
Richardson's theorem,
Zermelo's theorem,
Kruskal's tree theorem,
partial ordering relation,
de Bruijn-Erdős theorem,
total order,
partial order,
more...
▸ Words similar to robertson-seymour theorem
▸ Usage examples for robertson-seymour theorem
▸ Idioms related to robertson-seymour theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near robertson-seymour theorem
▸ Rhymes of robertson-seymour theorem
▸ Invented words related to robertson-seymour theorem