Claims

../

2026_09_03_adamczewski: The sharp tree-free edge bound proved for Problem 548 (found by GPT-6 Astra, published in Adamczewski's repository), applied to each color class, gives R_k(T) at most k(n - 2) + 2 for every tree on n at least 2 vertices; accepted on a third party's Lean derivation built and audited here.

2026_09_04_reed_stein: Corollary 4 of Reed and Stein (arXiv September 2026): for each k an n_0 with R_k(T) < k(n - 2) + 3 for every tree on n >= n_0 vertices, so the Statement holds when its constant may depend on k; the uniform reading is not covered.

---