Claims

../

1981_01_01_faudree: Faudree's result, credited by the site, [Er93] and Pikhurko: every graph on 2n+1 vertices with the problem's edge count is the union of a bipartite graph and a graph of maximum degree below n; a special case.

2001_07_01_pikhurko: Pikhurko's Theorem 1 (Combinatorica 21, 2001) bounds the size Ramsey number of a star with n edges versus a triangle below Erdős's conjectured value for every n ≥ 6, and a 44-edge instance refutes it at n = 5; the answer is no.

---