The Kelmans–Seymour conjecture refines this theorem by providing a condition under which only one of these two subdivisions, the subdivision of , can be guaranteed to exist. It states that, if a non-planar graph is 5-vertex-connected, then it contains a subdivision of .
