Connectivity and chromatic number of infinite graphs (Q1120588)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity and chromatic number of infinite graphs |
scientific article |
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
