\(k\)-connected graphs without \(K_4^-\). (Q2804809)

Let \(K_4^-\) denote the complete graph \(K_4\) with a single edge removed. An edge of a \(k\)-connected graph \(G\) is called \(k\)-contractible if its contraction yields a \(k\)-connected graph. The author proves the following: If \(G\) is a \(K_4^-\)-free \(k\)-connected graph, where \(k\geq 3\) is odd, then \(G\) has at least \(\min \{k+1,| G| /2\}\) \(k\)-contractible edges. This is a strong improvement over what was known previously. In addition, the author studies properties of \(K_4^-\)-free contraction critical \(k\)-connected graphs, and proves that such a graph has at least \(2| G| /(k-1)\) vertices of degree \(k\).