Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph (Q1348657)

Let \(k\) and \(n\) be positive integers with \(k\leq n\). The author continues the study of \(k\)-critically \(n\)-connected grahps (shortly \((n,k)\)-graphs). He proves several interesting results of the number of vertices of an \((n,k)\)-graph, depending on his results on hypergraphs.