CollapseProblem 1104Let f(n)f(n)f(n) be the maximum possible chromatic number of a triangle-free graph on nnn vertices. Estimate f(n)f(n)f(n).Source: erdosproblems.com/1104Graph theoryChromatic numberWiki pageStatusOpenNo claim settles this problem.ReferencesDaIl22Davies, Ewan and Illingworth, Freddie, The χ\chiχ-Ramsey problem for triangle-free graphs. SIAM J. Discrete Math. (2022), 1124-1134.HHKP25Z. Hefty, P. Horn, D. King, and F. Pfender, Improving R(3,k)R(3,k)R(3,k) in just two bites. arXiv:2510.19718 (2025).Ki95Kim, J. H., The Ramsey number R(3,t)R(3,t)R(3,t) has order of magnitude t2/logtt^2/\log tt2/logt. Random Structures and Algorithms (1995), 173-207.