On coloring graphs with locally small chromatic number (Q759761): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q792346 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: William T. jun. Trotter / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3869375 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579219 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022925674 / rank | |||
Normal rank | |||
Latest revision as of 11:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On coloring graphs with locally small chromatic number |
scientific article |
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
