Finding Patterns Avoiding Many Monochromatic Constellations

DOI10.1080/10586458.2010.10390631zbMath1247.05254OpenAlexW2089360227MaRDI QIDQ2911514

Kevin P. Costello, Steve Butler, Ronald L. Graham

Publication date: 31 August 2012

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1317758100

zbMATH Keywords

blockscoloringarithmetic progressionsmonochromatic solutionsconstellations

Mathematics Subject Classification ID

Ramsey theory (05D10) Arithmetic progressions (11B25)

Related Items (3)

Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\) ⋮ On the minimum number of monochromatic generalized Schur triples ⋮ Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

Cites Work

• Quantitative theorems for regular systems of equations
• On the number of monochromatic Schur triples.
• The number of monochromatic Schur triples
• On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
• Finite field models in arithmetic combinatorics -- ten years on
• A Disproof of a Conjecture of Erdős in Ramsey Theory

This page was built for publication: Finding Patterns Avoiding Many Monochromatic Constellations