A 2-coloring of [1,n] can have (n2)/22 + O(n) monochromatic Schur triples, but not less!
Aaron Robertson, Doron Zeilberger
Abstract
We prove that the minimum number (asymptotically) of monochromatic Schur triples that a 2-coloring of [1,n] can have is (n2)/22 + O(n). This was solved independently by Tomasz Schoen.
Create a lesson
Related papers
2-large sets are sets of nil-Bohr recurrence
Ryan Alweiss, Sohail Farhangi
New tools for sparse graph embeddings: Hybrid expanders and application to nested cycles
Nemanja Draganić
Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections
Lihua You, Xiaoxue Zhang, Xinghui Zhao
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar et al.
The (km,kn)-square paths theorem
Dun Qiu, Minhao Zhang
Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph
Joseph Natal, Oleksiy Al-saadi