A note on the edge-connectivity of cages (Q1871385): Difference between revisions

Summary: A \((k;g)\)-graph is a \(k\)-regular graph with girth \(g\). A \((k;g)\)-cage is a \((k;g)\)-graph with the smallest possible number of vertices. We prove that \((k;g)\)-cages are \(k\)-edge-connected if \(k\geq 3\) and \(g\) is odd.