Bookmarks
Concepts
Activity
Courses
Learning Plans
Courses
Request
Log In
Sign up
New Course
Concept
Graph Minor
A
graph minor
is a graph obtained from another graph by
deleting edges
, deleting vertices, and
contracting edges
. The
graph minor
Theorem, proved by Robertson and Seymour, states that in any
infinite set of graphs
, one graph is a
minor of another
, which has
profound implications
in
graph theory
and
algorithm design
.
Relevant Degrees
Number Theory 70%
Combinatorial Analysis and Graph Theory 30%
Generate Assignment Link
Lessons
Concepts
Suggested Topics
Foundational Courses
Learning Plan
Log in to see lessons
Log In
Sign up
3