Wan, Honghui, Upper bounds for Ramsey numbers $R(3,3,\cdots,3)$ and Schur numbers. J. Graph Theory 26 (1997), no. 3, 119--122, DOI 10.1002/(SICI)1097-0118(199711)26:3<119::AID-JGT1>3.0.CO;2-U (received 9 November 1990, revised 15 June 1993, per p. 119). Theorem 2.4, p. 121: $R(3;k)\le k!(e-e^{-1}+3)/2+1$ for $k\ge4$, from Folkman's $R(3;4)\le65$ through a parity refinement of the Greenwood–Gleason recursion. A historical factorial upper bound, superseded by [XXC02] as given in Eliahou's Corollary 2 (see Known Results); it does not bear on the limit. Library home: Wan 1997 and its Wan 1997, Theorem 2.4 page.

Whitehead, Jr., Earl Glen, The Ramsey number $N(3,\,3,\,3,\,3;\,2)$. Discrete Math. 4 (1973), no. 4, 389--396, DOI 10.1016/0012-365X(73)90174-X (Crossref record accessed). The site's text prints no volume.

Xu, Xiao Dong and Xie, Zheng and Chen, Zhi, Upper bounds for Ramsey numbers $R_n(3)$ and Schur numbers (in Chinese). Math. Econ. 19 (2002), no. 1, 81--84 (volume and issue from the bibliography of Radziszowski's Small Ramsey numbers, Electron. J. Combin. DS1.18, revision of 24 April 2026; no Crossref record). The site's text prints no volume.

Erdős, P., Some unsolved problems. Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961), 221--254. A site key. Its item 20 of Part I (printed pp. 232--233) states Schur's theorem and the conjecture that the Schur numbers $f(n)$ satisfy $f(n)<c^n$ and $f(n)^{1/n}\to C$, the question in its Schur-number form (read literally, Erdős's $f(n)$ is $S(n)+2\le R(3;n)$, where $S(n)$, the largest $N$ for which $\{1,\ldots,N\}$ has an $n$-coloring with no monochromatic solution of $x+y=z$, is at most $R(3;n)-2$); the paper states neither $R(3;k)$ nor a prize. The site's commentary records that Erdős offered a prize for showing the limit finite, the opposite of the answer. Library home: Erdős 1961.

Eliahou, S., An adaptive upper bound on the Ramsey numbers $R(3,\ldots,3)$. Integers 20 (2020), Paper A54, 7 pp. A site key, cited for more on the upper bound: its introduction surveys the upper bounds on $R(3;k)$, and its Corollary 2 (p. 4) is the proof of the $k!(e-1/6)+1$ bound of [XXC02] from $R(3;4)\le62$. Library home: Eliahou 2020 and its Eliahou 2020, Corollary 2 page.

Heinrich, K., Proper colourings of $K_{15}$. J. Austral. Math. Soc. 24 (Series A) (1977), 465--495, DOI 10.1017/S1446788700020838. Not a site reference; the classification of the good $3$-colorings of $K_{15}$ that the computational proof of the finite bound $R_4(3)\le62$ consumes (see Known Results). Theorem 2, printed p. 485; the proofs read for structure only. Library home: Heinrich 1977 and its Heinrich 1977, Theorem 2 page.

Kalbfleisch, J. G. and Stanton, R. G., On the maximal triangle-free edge-chromatic graphs in three colors. J. Combinatorial Theory 5 (1968), 9--20, DOI 10.1016/S0021-9800(68)80024-9. Not a site reference; the classification of the good $3$-colorings of $K_{16}$, the two seeds of every stage of the computational proof of $R_4(3)\le62$ and the classification [He77] assumes (see Known Results). The Theorem, printed p. 19, with the incidence matrices of Tables 2(a) and 2(b), p. 16; the proofs read for structure only. Library home: Kalbfleisch and Stanton 1968 (filed from the publisher's open archive) and its Kalbfleisch and Stanton 1968, Theorem (p. 19) page.

Laywine, C. and Mayberry, J. P., A simple construction giving the two non-isomorphic triangle-free 3-colored $K_{16}$'s. J. Combin. Theory Ser. B 45 (1988), 120--124, DOI 10.1016/0095-8956(88)90062-7. Not a site reference; the construction of both good $3$-colorings of $K_{16}$ from four tricolored tetrahedra that the computational proof of $R_4(3)\le62$ cites in place of an edge table for its two seeds (see Known Results). The Lemma, printed p. 122, and the Theorem with the identification of the two classes, printed p. 123; the two proofs, a paragraph each, read in full. Library home: Laywine and Mayberry 1988 (filed from the publisher's open archive) and its Laywine and Mayberry 1988, Theorem (p. 123) page.