M.Kriesell conjectured that there existed , such that every 5-connected graph with at least vertices can be contracted to a 5-connected graph such that . We show that this conjecture holds for vertex transitive 5-connected graphs.

中文翻译：

---

如何收缩顶点传递五连通图

M.Kriesell推测存在， 因此每个至少具有顶点的5连通图都可以收缩为5连通图，从而。我们证明了这个猜想适用于顶点传递5连通图。