Last Updated
：2025/12/04
Robertson-Seymour theorem
Proper noun
Japanese Meaning
グラフ理論において、任意の無向グラフ全体が、グラフ・マイナーという関係により部分順序付けされると、その順序が良準順序（well-quasi-ordering）を形成することを示す定理
（ canonical ）
Quizzes for review
(graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Robertson-Seymour theorem
In combinatorial graph theory, the Robertson-Seymour theorem provides a foundational result that underpins many results on graph minors and fixed-parameter algorithms.
See correct answer
In combinatorial graph theory, the Robertson-Seymour theorem provides a foundational result that underpins many results on graph minors and fixed-parameter algorithms.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
