Kelmans–Seymour conjecture
id:
kelmans-seymour-conjecture-191-10268071
title:
Kelmans–Seymour conjecture
text:
In graph theory, the Kelmans–Seymour 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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Kelmans%E2%80%93Seymour_conjecture
date created:
date modified:
2023-02-22T23:09:34Z
main entity:
{"identifier":"Q24687039","url":"https://www.wikidata.org/entity/Q24687039"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/f/f2/K5-in-Crown12.svg","width":610,"height":613}
fields total:
13
integrity:
14