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