. "In graph theory, the Kelmans\u2013Seymour conjecture states that every 5-vertex-connected graph that is not planar contains a subdivision of the 5-vertex complete graph K5. It is named for Paul Seymour and Alexander Kelmans, who independently described the conjecture; Seymour in 1977 and Kelmans in 1979. A proof was announced in 2016, and published in four papers in 2020."@en . . . . . . . . . . . "1095331896"^^ . . . . . . . . . . "In graph theory, the Kelmans\u2013Seymour conjecture states that every 5-vertex-connected graph that is not planar contains a subdivision of the 5-vertex complete graph K5. It is named for Paul Seymour and Alexander Kelmans, who independently described the conjecture; Seymour in 1977 and Kelmans in 1979. A proof was announced in 2016, and published in four papers in 2020."@en . "6338"^^ . . . . . . . . "50765752"^^ . . . . . "Kelmans\u2013Seymour conjecture"@en . .