Timeline for Proving edge connectivity
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2010 at 21:20 | comment | added | David Eppstein | Or, similarly but maybe a little more simply: let {u,v} be a two-vertex cut, and let x and y be vertices on opposite sides of the cut. If G were 5-edge-connected then there would be five edge-disjoint paths from x to y, each of which passes through u or v (or both); therefore, by the pigeonhole principle, at least three of the paths would have to go through one of the two vertices u and v, an impossibility. | |
| May 15, 2010 at 20:38 | history | edited | Tony Huynh | CC BY-SA 2.5 |
edited body
|
| May 15, 2010 at 19:41 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 1 characters in body
|
| May 15, 2010 at 19:30 | history | answered | Tony Huynh | CC BY-SA 2.5 |