K5K5-Subdivisions in graphs containing K4−

Seymour and, independently, Kelmans conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5K5. In this paper, we prove the conjecture for graphs containing K4−.