On coloring graphs with locally small chromatic number (Q759761)
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 3882453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On coloring graphs with locally small chromatic number |
scientific article; zbMATH DE number 3882453 |
Statements
On coloring graphs with locally small chromatic number (English)
0 references
1984
0 references
It is proved that for each pair of positive integers c and k, if G is a graph on n vertices with no subgraph H, whose chromatic number is greater than c and whose radius in G is at most \(2kn^{1/k}\), then the chromatic number of G is at most \(k(c-1)+1\). As a special case a conjecture of \textit{P. Erdős} is settled in the affirmative [see Graph theory and related topics, Proc. Conf. Honour W. T. Tutte, Waterloo/Ont. 1977, 153-163 (1979; Zbl 0457.05024)].
0 references
chromatic number
0 references
0.8556989431381226
0 references
0.8246517181396484
0 references
0.8223029375076294
0 references
0.8135875463485718
0 references
