Claims

../

1983_03_01_beck: Beck's 1983 theorem (J. Graph Theory) that the size Ramsey number of the path is below 900n for large n, answering the first question no and the second yes; refereed and credited by the site's curator; the paper is not held here.

1995_09_01_haxell_kohayakawa_luczak: Haxell, Kohayakawa and Łuczak (1995), Theorem 10 and Corollary 11: linearly many edges force induced monochromatic cycles of every length in a linear range, so the size Ramsey numbers of cycles and paths are linear; refereed.

---