Connectivity and chromatic number of infinite graphs (Q1120588)
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: Connectivity and chromatic number of infinite graphs |
scientific article; zbMATH DE number 4101219
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity and chromatic number of infinite graphs |
scientific article; zbMATH DE number 4101219 |
Statements
Connectivity and chromatic number of infinite graphs (English)
0 references
1986
0 references
It is proved that for every positive integer n, a graph of uncountable chromatic number contains an n-connected subgraph H of uncountable chromatic number such that every vertex of H has infinite degree in H.
0 references
infinite graphs
0 references
uncountable chromatic number
0 references
0.9667702
0 references
0.9417836
0 references
0.93751436
0 references
0.9353455
0 references
0 references
0.92888916
0 references
0.9269233
0 references
