Triangle-free graphs with large chromatic numbers (Q1969797)

It is shown that there are two positive constants \(c_1, c_2\) such that the maximum possible chromatic number of a triangle-free graph with \(m>1\) edges is at most \(c_1m^{1/3}/(\log m)^{2/3}\) and at least \(c_2m^{1/3}/(\log m)^{2/3}\). This settles a problem of Erdős.