Details

Autor(en) / Beteiligte

• Kriesell, Matthias

Titel

Upper Bounds to the Number of Vertices in a k -Critically n -Connected Graph

Ist Teil von

• Graphs and combinatorics, 2002-03, Vol.18 (1), p.133-146

Ort / Verlag

Tokyo: Springer Nature B.V

Erscheinungsjahr

2002

Link zum Volltext

Quelle

SpringerLINK Contemporary (Konsortium Baden-Württemberg)

Beschreibungen/Notizen

•   Let khn be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (nm|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. [PUBLICATION ABSTRACT]