Proves that the maximum fraction of rainbow Schur triples in 3-colorings of [n] satisfies 0.4 ≤ fraction ≤ 0.66364 and conjectures the lower bound is tight.
The Rado multiplicity problem in vector spaces over finite fields.arXiv preprint arXiv:2304.00400, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Unsure Note on an Un-Schur Problem
Proves that the maximum fraction of rainbow Schur triples in 3-colorings of [n] satisfies 0.4 ≤ fraction ≤ 0.66364 and conjectures the lower bound is tight.