A 2-Coloring of $[1,N]$ can have $(1/22)N^2+O(N)$ Monochromatic Schur Triples, but not less!

Aaron Robertson, Doron Zeilberger

Type: Article

Publication Date: 1998-03-25

Citations: 31

DOI: https://doi.org/10.37236/1357

Abstract

We prove the statement of the title, thereby solving a $100 problem of Ron Graham. This was solved independently by Tomasz Schoen.

Locations

The Electronic Journal of Combinatorics - View - PDF

Similar Works

Action	Title	Year	Authors
+	A 2-coloring of [1,n] can have (n^2)/22 + O(n) monochromatic Schur triples, but not less!	1998	Aaron Robertson Doron Zeilberger
+	A 2-coloring of $[1,n]$ can have $\frac{n^2}{2a(a^2+2a+3)} + O(n)$ monochromatic triples of the form $\{x,y,x+ay\}, a \geq 2$, but not less!	2008	Thotsaporn Thanatipanonda
+	On the monochromatic Schur Triples type problem	2008	Thotsaporn Thanatipanonda
+	On the monochromatic Schur Triples type problem	2008	Thotsaporn Thanatipanonda
+ PDF Chat	On the Monochromatic Schur Triples Type Problem	2009	Thotsaporn Thanatipanonda
+ PDF Chat	An Unsure Note on an Un-Schur Problem	2024	Olaf Parczyk Christoph Spiegel
+	The Number of Monochromatic Schur Triples	1999	Tomasz Schoen
+	On the Minimum Number of Monochromatic Generalized Schur Triples, $(x,y,x+ay), \, a\geq 2$, over any 2-coloring of $[1,n]$	2016	Thotsaporn Thanatipanonda Elaine Wong
+ PDF Chat	Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers	2019	Elad Aigner‐Horev Yury Person
+	No-hole L(2,1)-colorings	2003	Peter C. Fishburn Fred S. Roberts
+	On the Minimum Number of Monochromatic Generalized Schur Triples	2017	Thotsaporn Thanatipanonda Elaine Wong
+	Monochromatic Schur triples in randomly perturbed dense sets of integers	2018	Elad Aigner‐Horev Yury Person
+	Monochromatic Schur triples in randomly perturbed dense sets of integers	2018	Elad Aigner‐Horev Yury Person
+ PDF Chat	On the minimum number of monochromatic 2-dimensional Schur triples	2024	Aaron Robertson
+ PDF Chat	Generalized Schur Numbers for $x_1 + x_2 + c = 3x_3$	2009	André E. Kézdy Hunter S. Snevily Susan C. White
+ PDF Chat	Optimal bounds on the polynomial Schur's theorem	2024	Jaehoon Kim Hong Liu Péter Pál Pach
+	A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers	1994	Geoffrey Exoo
+	On the number of monochromatic Schur triples	2003	Boris A. Datskovsky
+	On the 3-Color Ramsey Numbers $$R(C_4,C_4,W_{n})$$	2022	Xuemei Zhang Yaojun Chen T.C.E. Cheng
+ PDF Chat	Schur numbers involving rainbow colorings	2020	Mark Budden

Works That Cite This (29)

Action	Title	Year	Authors
+ PDF Chat	Uncommon Systems of Equations	2021	Nina Kamčev Anita Liebenau Natasha Morrison
+ PDF Chat	Exact Lower Bounds for Monochromatic Schur Triples and Generalizations	2020	Christoph Koutschan Elaine Wong
+ PDF Chat	Open problems in additive combinatorics	2007	Ernest S. Croot Vsevolod F. Lev
+ PDF Chat	Finding Patterns Avoiding Many Monochromatic Constellations	2010	Steve Butler Kevin Costello Ron Graham
+ PDF Chat	On monochromatic solutions of equations in groups	2007	Peter J‎. Cameron Javier Cilleruelo Oriol Serra
+	On the asymptotic minimum number of monochromatic 3-term arithmetic progressions	2007	Pablo A. Parrilo Aaron Robertson Dan Saracino
+	Monochromatic 4-term arithmetic progressions in 2-colorings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi mathvariant="double-struck">Z</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:math>	2012	Linyuan Lü Xing Peng
+	A Schur-type addition theorem for primes	2011	Hongze Li Hao Pan
+	Disjunctive Rado numbers	2005	Brenda K. Johnson Daniel Schaal
+	On uncommon systems of equations	2024	Nina Kamčev Anita Liebenau Natasha Morrison

Works Cited by This (2)

Action	Title	Year	Authors
+	The Number of Monochromatic Schur Triples	1999	Tomasz Schoen
+	On Schur Properties of Random Subsets of Integers	1996	Ronald Graham Vojtěch Rödl Andrzej Ruciński