Generalized Schur-number conjecture for x+(k−1)y=z
For every integer , let be the least positive integer such that every coloring admits with and . The conjecture asserts that for all .
Equivalent formulations
For every integer , let be the least positive integer such that every coloring of with three colors admits a monochromatic solution to . Equivalently, the conjecture asserts that for all .
References
- The Three-Color Generalized Schur Number of x+(k-1)y=z: A Proof for All k from a Critical Set of 33 Polynomials — arXiv — Amir Khamseh, Mohammad Hassan Safareh
Source: arXiv
Progress summary
An unrefereed preprint claims to determine the entire three-color family, but its proof has not been independently checked.
The conjecture predicts exact three-color generalized Schur-number values for the equation across all parameters. No original proposer or date is identified in the retrieved sources.
November 2026 preprint claim
Amir Khamseh and Mohammad Hassan Safareh claim a complete result using a uniform critical-set argument for the upper bound and an explicit recursive coloring for the lower bound. If correct, this settles an infinite family of three-color Ramsey-type values. The manuscript is unrefereed, and its computer-assisted case analysis has not been independently assessed.
Current status (as of November 2026): The general conjecture is claimed solved by an unrefereed preprint, but the result remains unverified.
Sources
Solutions 0
No solutions have been posted yet.