On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs (Q2197449)
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: On the extremal sizes of maximal graphs without ( k + 1 )-connected subgraphs |
scientific article; zbMATH DE number 7242106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs |
scientific article; zbMATH DE number 7242106 |
Statements
On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs (English)
0 references
31 August 2020
0 references
connectivity
0 references
subgraph connectivity
0 references
vertex-\(k\)-maximal graph
0 references
extremal graphs
0 references
0.8627590537071228
0 references
0.8548358678817749
0 references
0.8491643667221069
0 references
