Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph (Q1348657)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph |
scientific article; zbMATH DE number 1740497
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph |
scientific article; zbMATH DE number 1740497 |
Statements
Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph (English)
0 references
14 May 2002
0 references
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.
0 references
bounds
0 references
\(k\)-critically \(n\)-connected grahps
0 references
hypergraphs
0 references
