Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2019-12-19 , DOI: 10.1016/j.jctb.2019.12.002 Dawei He , Yan Wang , Xingxing Yu
A well known theorem of Kuratowski in 1932 states that a graph is planar if, and only if, it does not contain a subdivision of or . Wagner proved in 1937 that if a graph other than does not contain any subdivision of then it is planar or it admits a cut of size at most 2. Kelmans and, independently, Seymour conjectured in the 1970s that if a graph does not contain any subdivision of then it is planar or it admits a cut of size at most 4. In this paper, we give a proof of the Kelmans-Seymour conjecture. We also discuss several related results and problems.
中文翻译:
凯尔曼-西摩猜想四:证明
著名的Kuratowski定理在1932年指出,当且仅当图不包含的细分时,图才是平面的。 要么 。瓦格纳(Wagner)在1937年证明, 不包含的任何细分 那么它是平面的,或者它最多允许切成2的大小。凯尔曼斯(Kelmans)以及西摩(Seymour)独立地推测,在1970年代,如果图形不包含任何细分, 那么它是平面的,或者最多允许切成4的大小。在本文中,我们给出了Kelmans-Seymour猜想的证明。我们还将讨论一些相关的结果和问题。