- #1
andreass
- 16
- 0
How to prove that for every k-connected graph (k>=2) with at least 2*k vertices, there exists subgraph, which is cycle with at least 2*k vertices?
Ok, it’s obvious for k=2. It looks something like cycle with or without some other edges:
But I've no ideas how to prove it for k>2
Any hints?
Ok, it’s obvious for k=2. It looks something like cycle with or without some other edges:
But I've no ideas how to prove it for k>2
Any hints?