Constructing graphs with no immersion of large complete graphs (Q2922213)
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: Constructing graphs with no immersion of large complete graphs |
scientific article; zbMATH DE number 6353341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing graphs with no immersion of large complete graphs |
scientific article; zbMATH DE number 6353341 |
Statements
9 October 2014
0 references
graph immersion
0 references
minimum degree
0 references
chromatic number
0 references
edge-connectivity
0 references
Hajós conjecture
0 references
Hadwiger conjecture
0 references
graph minor
0 references
subdivision
0 references
0.90582883
0 references
0.8991561
0 references
0.8900995
0 references
0 references
0.8793428
0 references
0.87757677
0 references
0.87513363
0 references
0.87465334
0 references
0 references
Constructing graphs with no immersion of large complete graphs (English)
0 references
