The Erdős-Pósa property for clique minors in highly connected graphs (Q412171)
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: The Erdős-Pósa property for clique minors in highly connected graphs |
scientific article; zbMATH DE number 6030283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Erdős-Pósa property for clique minors in highly connected graphs |
scientific article; zbMATH DE number 6030283 |
Statements
The Erdős-Pósa property for clique minors in highly connected graphs (English)
0 references
4 May 2012
0 references
Erdős-Pósa
0 references
clique minor
0 references
packing
0 references
disjoint cycles
0 references
0.8268743753433228
0 references
0.8159092664718628
0 references
0.8007312417030334
0 references
0.7944916486740112
0 references
0.7943993806838989
0 references
