Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746)
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: Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density |
scientific article; zbMATH DE number 5542399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density |
scientific article; zbMATH DE number 5542399 |
Statements
Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (English)
0 references
9 April 2009
0 references
graph minors
0 references
edge density
0 references
connected subgraphs
0 references
