Lower bounds on the weak Schur numbers up to 9 colors

MaRDI QIDQ5384174zbMATH OpenFDO

Authors Rafilipojaona

Publication date 21 June 2019

Full work available at URL http://math.colgate.edu/~integers/r39/r39.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

highly structured \(n\)-colorings

Mathematics Subject Classification ID

Ramsey theory (05D10)

Recommendations

• A general lower bound on the weak Schur number
• Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\)
• New lower bounds for weak Schur partitions
• A lower bound for weak Schur numbers with a deterministic algorithm
• Weak Schur numbers and the search for G. W. Walker's lost partitions

Cites work

• A problem of Schur and its generalizations
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Partitions into sum-free sets
• Symmetric sum-free partitions and lower bounds for Schur numbers
• Weak Schur numbers and the search for G. W. Walker's lost partitions

Cited in

(8)

• Symmetric sum-free partitions and lower bounds for Schur numbers
• A lower bound for weak Schur numbers with a deterministic algorithm
• A general lower bound on the weak Schur number
• Modular Schur numbers
• Weak Schur numbers and the search for G. W. Walker's lost partitions
• New lower bounds for weak Schur partitions
• A weakened version of strict Schur numbers
• Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\)

This page was built for publication: Lower bounds on the weak Schur numbers up to 9 colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384174)