Description
Problem 1: Prove that if we can solve the r-Vertex Disjoint Paths problem in polynomial time then we
can determine if G contains another graph H as a minor in polynomial time.
Problem 1: Prove that if we can solve the r-Vertex Disjoint Paths problem in polynomial time then we
can determine if G contains another graph H as a minor in polynomial time.
