An Unsure Note on an Un-Schur Problem
The Electronic Journal of Combinatorics · 2026-03-13 · 33 (1)
DOI: 10.37236/13554 ↗At a glance
Journal article in The Electronic Journal of Combinatorics, published online on 2026-03-13. Written by Olaf Parczyk and 1 co-authors.
Abstract (original language)
Graham, Rödl, and Ruciński originally posed the problem of determining the minimum number of monochromatic Schur triples that must appear in any 2-coloring of the first n integers. This question was subsequently resolved independently by Datskovsky, Schoen, and Robertson and Zeilberger. Here we suggest studying a natural anti-Ramsey variant of this question and establish the first non-trivial bounds by proving that the maximum fraction of Schur triples that can be rainbow in a given 3-coloring of the first n integers is at least 0.4 and at most 0.66364. We conjecture the lower bound to be tight. This question is also motivated by a famous analogous problem in graph theory due to Erdős and Sós regarding the maximum number of rainbow triangles in any 3-coloring of Kn, which was settled by Balogh et al..
Cite
APA
Parczyk, O., & Spiegel, C. (2026). An Unsure Note on an Un-Schur Problem. The Electronic Journal of Combinatorics, 33(1). https://doi.org/10.37236/13554
Vancouver
Parczyk O, Spiegel C. An Unsure Note on an Un-Schur Problem. The Electronic Journal of Combinatorics. 2026;33(1). doi:10.37236/13554
BibTeX
@article{Parczyk2026,
author = {Parczyk, Olaf and Spiegel, Christoph},
title = {An Unsure Note on an Un-Schur Problem},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {1},
doi = {10.37236/13554}
}
EUVIMED