How to contract a vertex transitive 5-connected graph (Q782134): Difference between revisions

Summary: M. Kriesell conjectured that there existed \(b, h\) such that every 5-connected graph \(G\) with at least \(b\) vertices can be contracted to a 5-connected graph \(G_0\) such that \(0<\left| V \left( G\right)\right|-\left( V \left( G_0\right)\right)<h\). We show that this conjecture holds for vertex transitive 5-connected graphs.