On the minimum number of monochromatic generalized Schur triples

zbMath1361.05134arXiv1609.07639MaRDI QIDQ529002

Elaine Wong, Thotsaporn ``Aek Thanatipanonda

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.07639

zbMATH Keywords

optimizationSchur triplesRado equationRamsey theory on integers

Mathematics Subject Classification ID

Ramsey theory (05D10)

Related Items (1)

Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

Uses Software

• RON

Cites Work

• On the monochromatic Schur triples type problem
• On Schur properties of random subsets of integers
• A 2-coloring of \([1, N\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less]
• On the number of monochromatic Schur triples.
• The number of monochromatic Schur triples
• Finding Patterns Avoiding Many Monochromatic Constellations
• On Sets of Acquaintances and Strangers at any Party
• Unnamed Item

This page was built for publication: On the minimum number of monochromatic generalized Schur triples