On extremal \(k\)-outconnected graphs (Q2427512): Difference between revisions

The author cites two results of \textit{W. Mader} [Arch. Math. 23, 553--560 (1972; Zbl 0228.05119), Math. Nachr. 53, 145--150 (1972; Zbl 0217.02504), and Abh. Math. Semin. Univ. Hamb. 37, 86--97 (1972; Zbl 0215.33803)] and one of \textit{M. Cai} [Discrete Math. 41, 229--234 (1982; Zbl 0522.05040)] for minimally \(k\)-connected graphs. Here he generalizes these results of Mader and Cai, and proves the maximum number of edges in a minimally \(k\)-outconnected graph and derives all the cases when this bound is tight. (The estimations proved are relatively long and complicated).