Solved, in the site's label (SOLVED, the site's label for a resolution that is neither a proof nor a disproof), which attaches to the estimate: for fixed $k$ and all sufficiently large $n$, Theorem 6 of Burr, Erdős and Spencer (Trans. Amer. Math. Soc. 209 (1975), refereed) gives the exact value

$$f(n,k)=r(k,k-1)-1+\mathrm{rem}(n-r(k,k-1)+1,\,k),$$

where $r(k,k-1)$ is the off-diagonal Ramsey number and $\mathrm{rem}(a,b)$ the remainder of $a$ on division by $b$; so the eventual maximum over $n$ is $r(k,k-1)+k-2$ and the eventual minimum $r(k,k-1)-1$. The claim page Burr, Erdős and Spencer 1975 records Theorem 6 as the accepted resolution, on the curator's credit and the refereed publication, and the frontmatter standing derives from it. Moon's theorem, the case $t=3$ with the site's value $f(3)=4$, is an accepted partial claim, Moon 1966. The two closing questions are not stated in [BES75]; an elementary deduction from Theorem 6 and Erdős's 1947 bound, written out under Current assessment and named as this page's own, is not acceptance evidence and does not enter the standing. The site's formula differs from the paper's by the term $-1$ (recorded below, not repaired).