3-color Schur numbers

DOI10.1016/j.dam.2018.06.030zbMath1414.05038OpenAlexW2904524109MaRDI QIDQ2420409

Yanyan Li

Publication date: 6 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.030

zbMATH Keywords

sum-free setsSchur numbersmonochromatic solution\(n\)-coloring

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items (2)

Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\) ⋮ Schur's theorem in integer lattices

Cites Work

• Unnamed Item
• Symmetric sum-free partitions and lower bounds for Schur numbers
• Studien zur Kombinatorik
• On Generalized Schur Numbers
• An extension of Schur's theorem on sum-free partitions
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: 3-color Schur numbers