Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\) (Q1175546)

It is shown that every \(n\)-connected graph \((n\geq 2)\) with minimum degree at least \([5n/4]\) other than \(K_ 3\) and \(K_ 4\) for \(n=2\) and 3, respectively, has an \(n\)-contractible edge. More generally, for \(n\geq 2\) and \(G\) an \(n\)-connected graph other than \(K_{n+1}\), if \(G\) has no \(n\)- contractible edge then \(G\) has a fragment of cardinality at most \(n/4\).