The colouring number of infinite graphs (Q2300155)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7175039
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The colouring number of infinite graphs |
scientific article; zbMATH DE number 7175039 |
Statements
The colouring number of infinite graphs (English)
0 references
26 February 2020
0 references
The authors show that a graph has colouring number not larger than a given infinite cardinal if and only if it contains neither of two types of subgraph. This characterisation also re-establishes a previous result that every graph with infinite colouring number has a well-ordering of its vertices.
0 references
colouring number
0 references
infinite graphs
0 references
characterisation
0 references
0.8557642698287964
0 references
0.827924370765686
0 references
0.8000869750976562
0 references
0.7874725461006165
0 references
