Claims

../

2023_06_06_mattheus_verstraete: The bound r(4,t) of order at least t^3/(log t)^4 of Mattheus and Verstraete gives K_4-free graphs on n vertices with chromatic number at least a constant times n^(2/3)/(log n)^(4/3); refereed, and credited by the site for k = 4.

2026_06_16_bradac: Bradač's bound r(k,t) of order at least t^(k-1)/(log t)^(2k-4) gives K_k-free graphs on n vertices with chromatic number at least a constant times n^(1-1/(k-1))/(log n)^((2k-4)/(k-1)); a preprint credited by the site.

---