Abstract
We consider m-colorings of the edges of a complete graph, where each color class is defined semi-algebraically with bounded complexity. The case m = 2 was first studied by Alon et al., who applied this framework to obtain surprisingly strong Ramsey-type results for intersection graphs of geometric objects and for other graphs arising in computational geometry. Considering larger values of m is relevant, e.g., to problems concerning the number of distinct distances determined by a point set.
For p ≥ 3 and m ≥ 2, the classical Ramsey number R(p; m) is the smallest positive integer n such that any m-coloring of the edges of Kn, the complete graph on n vertices, contains a monochromatic Kp. It is a longstanding open problem that goes back to Schur (1916) to decide whether R(p; m) ≤ 2cm, where c = c(p). We prove that this is true if each color class is defined semi-algebraically with bounded complexity, and that the order of magnitude of this bound is tight. Our proof is based on the Cutting Lemma of Chazelle et al., and on a Szemerédi-type regularity lemma for multicolored semi-algebraic graphs, which is of independent interest. The same technique is used to address the semi-algebraic variant of a more general Ramsey-type problem of Erdős and Shelah.
Similar content being viewed by others
References
N. Alon, J. Pach, R. Pinchasi, R. Radoičić and M. Sharir, Crossing patterns of semi-algebraic sets, Journal of Combinatorial Theory, Series A 111 (2005), 310–326.
S. Basu, R. Pollack and M.-R. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, Vol. 10, Springer, Berlin-Heidelberg, 2003.
B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Theoretical Computer Science 84 (1991), 77–105.
D. Conlon, J. Fox, C. Lee and B. Sudakov, The Erdős-Gyárfás problem on generalized Ramsey numbers, Proceedings of the London Mathematical Society 110 (2015), 1–15.
D. Conlon, J. Fox, J. Pach, B. Sudakov and A. Suk, Ramsey-type results for semialgebraic relations, Transactions of the American Mathematical Society 366 (2014), 5043–5065.
P. Erdős, Solved and unsolved problems in combinatorics and combinatorial number theory, Congressus Numerantium 32 (1981), 49–62.
P. Erdős and A. Gyárfás, A variant of the classical Ramsey problem, Combinatorica 17 (1997), 459–467.
J. Fox, M. Gromov, V. Lafforgue, A. Naor and J. Pach, Overlap properties of geometric expanders, Journal für die Reine und Angewandte Mathematik 671 (2012), 49–83.
J. Fox, J. Pach, A. Sheffer, A. Suk and J. Zahl, A semi-algebraic version of Zarankiewicz’s problem, Journal of the European Mathematical Society 19 (2017), 1785–1810.
J. Fox, J. Pach and A. Suk, A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing, SIAM Journal on Computing 45 (2016), 2199–2223.
J. Fox, J. Pach and A. Suk, More distinct distances under local conditions, Combinatorica 38 (2018), 501–509.
J. Fox and B. Sudakov, Ramsey-type problem for an almost monochromatic K4, SIAM Journal on Discrete Mathematics 23 (2008), 155–162.
W. T. Gowers, Lower bounds of tower type for Szemerédi’s uniformity lemma, Geometric and Functional Analysis 7 (1997), 322–337.
V. Koltun, Almost tight upper bounds for vertical decompositions in four dimensions, Journal of the ACM 51 (2004), 699–730.
A. V. Kostochka and D. Mubayi, When is an almost monochromatic K4guaranteed?, Combinatorics, Probability and Computing 17 (2008), 823–830.
J. Matoušek, Lectures on Discrete Geometry, Graduate Texts in Mathematics, Vol. 212, Springer, New York, 2002.
D. Mubayi, Edge-coloring cliques with three colors on all 4-cliques, Combinatorica 18 (1998), 293–296.
F. Ramsey, On a problem in formal logic, Proceedings of the London Mathematical Society 30 (1930), 264–286.
I. Schur, Über die Kongruenz xm + ym = zmmod p, Jahresbericht der Deutschen Mathematiker-Vereinigung 25 (1916), 114–117.
A. Suk, Semi-algebraic Ramsey numbers, Journal of Combinatorial Theory, Series B 116 (2016), 465–483.
E. Szemerédi, Regular partitions of graphs, in Problémes Combinatoires et Théorie des Graphes, Orsay (1976), Colloques Internationaux Centre National de la Recherche Scientifique, Vol. 260, Centre National de la Recherche Scientifique, Paris, 1976, 399–401.
X. Xiaodong, X. Zheng, G. Exoo and S. P. Radziszowski, Constructive lower bounds on classical multicolor Ramsey numbers, Electronic Journal of Combinatorics 11 (2004), Article no. R35.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by a Packard Fellowship and by NSF grant DMS-1855635.
Supported by Swiss National Science Foundation Grants 200020-162884 and 200021-175977. Partially supported by the National Research, Development and Innovation Office, NKFIH, project KKP-133864 and by the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant No. 075-15-2019-1926.
Supported by an NSF CAREER award DMS-1800746 and by an Alfred Sloan Fellowship.
Rights and permissions
About this article
Cite this article
Fox, J., Pach, J. & Suk, A. The Schur-Erdős problem for semi-algebraic colorings. Isr. J. Math. 239, 39–57 (2020). https://doi.org/10.1007/s11856-020-2042-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-020-2042-8