K 6 minors in 6-connected graphs of bounded tree-width
K 6 minors in 6-connected graphs of bounded tree-width
复制标题
有界树宽的 6 连通图中的 K 6 个次要
DOI：
10.1016/j.jctb.2017.08.006
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Wollan, Paul
中科院分区：
文献类型：
--
作者：
Kawarabayashi, Ken-ichi;Norine, Serguei;Thomas, Robin;Wollan, Paul
我们证明了每个足够大的有界树宽的6-连通图要么有K6子式，要么有一个顶点的删除使图平坦。这是向证明同样的结论适用于所有足够大的6-连通图迈出的一步。约根森猜想，它对所有6-连通图都成立。
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K 6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently large 6-connected graphs. Jørgensen conjectured that it holds for all 6-connected graphs.