Linked from

The 11 pages that link to Schur's theorem, each with the reason it gives.

• Ramsey theoryRelated: It shows that coloring integers cannot eliminate every simple additive equation.

• Ramsey's theoremCompared with: It exemplifies a coloring theorem that forces a specific algebraic pattern.

• Van der Waerden's theoremCompared with: It forces one additive equation, whereas Van der Waerden guarantees progressions of every finite length.

• Erdős–Szekeres theorem (monotone subsequences)Related: Its use of finite colorings and unavoidable patterns reflects a broader Ramsey-style viewpoint.

• Hales–Jewett theoremRelated: It is another arithmetic consequence in the same family of coloring arguments.

• Bunyakovsky conjectureCompared with: It proves infinitely many prime divisors, a weaker conclusion than infinitely many prime values.

• Zsigmondy's theoremCompared with: Schur guarantees infinitely many primes across polynomial values, rather than a new divisor at each exponent.

• Cameron–Erdős conjectureRelated: It shows that sum-free sets cannot occupy an entire color class indefinitely without additive constraints appearing.

• Friends and strangers theoremRelated: It is another Ramsey-style guarantee, but its unavoidable pattern is arithmetic rather than a triangle.

• Lonely runner conjectureRelated: Combinatorial methods related to Schur-type results enter some approaches to the conjecture.

• Schinzel's theoremCompared with: Schur guarantees prime divisors of values, while Schinzel guarantees prime moduli with roots.