Claims

../

2024_09_05_pokrovskiy_versteegen_williams: Theorem 1.3 of the paper in J. Combin. Theory Ser. B 176 (2026): for all n above 20 to the 40th, every two-edge-colored complete graph on n vertices is covered by root n monochromatic paths of one color; refereed.

2026_07_24_chen_chen: Theorem 1.5 of an unrefereed 2026 arXiv preprint: every red-blue edge-colored complete graph on n vertices is covered by at most root n monochromatic paths of one color, for every n; not adopted by the site.

---