The Erd\H{o}s-Hajnal conjecture for rainbow triangles

TL;DR

This paper proves bounds on the size of large monochromatic sets in edge-colored complete graphs without rainbow triangles, confirming a special case of the Erdős-Hajnal conjecture and generalizing it for multiple colors.

Contribution

It verifies a case of the multicolor Erdős-Hajnal conjecture for rainbow triangles and extends the result to arbitrary numbers of colors with tight bounds.

Findings

Established tight bounds for monochromatic sets in rainbow-triangle free colorings.

Generalized the result to r-colorings with s colors, determining the size of large monochromatic subsets.

Utilized Gallai's classification, a new weighted Ramsey theorem, and discrepancy inequalities in proofs.

Abstract

We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order Omega(n^{1/3}log^2 n) which uses at most two colors, and this bound is tight up to a constant factor. This verifies a conjecture of Hajnal which is a case of the multicolor generalization of the well-known Erd\H{o}s-Hajnal conjecture. We further establish a generalization of this result. For fixed positive integers s and r with s at most r, we determine a constant c_{r,s} such that the following holds. Every r-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order Omega(n^{r(r-1)/s(s-1)}(\log n)^{c_{r,s}}) which uses at most s colors, and this bound is tight apart from the implied constant factor. The proof of the lower bound utilizes Gallai's classification of rainbow-triangle free edge-colorings of the complete graph, a new weighted extension of Ramsey's theorem, and a discrepancy inequality in edge-weighted graphs. The proof of the upper bound uses Erd\H{o}s' lower bound on Ramsey numbers by considering lexicographic products of 2-edge-colorings of complete graphs without large monochromatic cliques.