A discussion on the powerful theorem in graph theory by Robinson and Seymour; that every class of graphs that is closed under taking minors can be determined whether it's in this class or not through a polynomial time algorithm. The discussion mainly focuses on planar graphs and non-planar graphs and their corresponding properties.