Prove that if a graph is k-connected, then it is also k-edge-connected

403 Views Asked by At

Here is my thought, first if it is k-connected, then every vertex has degree at least k. So removing a set of size k-1 edges will not result any isolated vertices. I don't know how to continue.