---

Claim. The conjectured formula of Problem 561, $\hat R(F_1,F_2)=\sum_{k=2}^{s+t}l_k$ with $l_k=\max\{n_i+m_j-1:i+j=k\}$, for every pair of star forests $F_1=\bigcup_{i\le s}K_{1,n_i}$ and $F_2=\bigcup_{j\le t}K_{1,m_j}$, together with the multicolor extension conjectured by Davoodi, Javadi, Kamranian and Raeisi. The first arXiv version of the preprint (3 June 2026, titled "Size Ramsey number for star forests") says in its abstract that the 1978 conjecture "was confirmed for many cases but is still open" and that "In this paper, we completely confirm these two conjectures" (arXiv:2606.04439v1, abstract).

Withdrawal. The second version (4 June 2026), retitled "Size Ramsey minimal graphs for star forests", drops the claim from its abstract, and the third (4 July 2026) is titled "Size Ramsey minimal graphs for uniform star forests" and characterizes the size Ramsey minimal graphs for uniform star forests in any number of colors (Theorem 1.5 of the library's source card). That result is adjacent to the problem and not progress on it: the two-color uniform case is the 1978 theorem of Burr, Erdős, Faudree, Rousseau and Schelp, and the third version says of the conjecture only that after Győri and Schelp it saw no progress until the 2025 special cases of Davoodi et al. (p. 2). The authors retitled the result below a proof of the conjecture, so the claim is recorded as withdrawn; no partial claim is recorded, since the third version asserts nothing about the general formula. In the site's discussion thread, a comment of 4 June 2026 relayed the first version's claim, and a comment later the same day reported that ChatGPT claims several serious errors and gaps in the argument and that the lead author had been informed; the site's commentary does not mention the preprint (page last edited 1 February 2026).

Depends on. Nothing in this wiki; the withdrawn argument was the authors' own. The texts of the first two versions are not held; this page's account of them rests on their abstracts and arXiv listing pages.