当前位置: X-MOL 学术J. Comb. Theory B › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The Kelmans-Seymour conjecture II: 2-Vertices in K4−
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2019-12-11 , DOI: 10.1016/j.jctb.2019.11.007
Dawei He , Yan Wang , Xingxing Yu

We use K4 to denote the graph obtained from K4 by removing an edge, and use TK5 to denote a subdivision of K5. Let G be a 5-connected nonplanar graph and {x1,x2,y1,y2}V(G) such that G[{x1,x2,y1,y2}]K4 with y1y2E(G). Let w1,w2,w3N(y2){x1,x2} be distinct. We show that G contains a TK5 in which y2 is not a branch vertex, or Gy2 contains K4, or G has a special 5-separation, or G{y2v:v{w1,w2,w3,x1,x2}} contains TK5. This result will be used to prove the Kelmans-Seymour conjecture that every 5-connected nonplanar graph contains TK5.



中文翻译:

Kelmans-Seymour猜想II:2-顶点 ķ4-

我们用 ķ4- 表示从获得的图 ķ4 通过去除边缘,并使用 Ťķ5 表示的细分 ķ5。令G为5连通的非平面图,{X1个X2ÿ1个ÿ2}VG 这样 G[{X1个X2ÿ1个ÿ2}]ķ4-ÿ1个ÿ2ËG。让w1个w2w3ñÿ2-{X1个X2}与众不同。我们证明G包含一个Ťķ5 在其中 ÿ2 不是分支顶点,或者 G-ÿ2 包含 ķ4-G具有特殊的5分隔符,或G-{ÿ2vv{w1个w2w3X1个X2}} 包含 Ťķ5。该结果将用于证明每个由5个连通的非平面图包含的Kelmans-Seymour猜想Ťķ5

更新日期:2019-12-11
down
wechat
bug