On coloring graphs with locally small chromatic number (Q759761)

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)].