Canonical Ramsey numbers of sparse graphs

Abstract

The canonical Ramsey theorem of Erdős and Rado implies that for any graph $H$, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph $K_N$ contains a monochromatic, lexicographic, or rainbow copy of $H$. The least such $N$ is called the Erdős-Rado number of $H$, denoted by $ER(H)$. Erdős-Rado numbers of cliques have received considerable attention, and in this paper we extend this line of research by studying Erdős-Rado numbers of sparse graphs. For example, we prove that if $H$ has bounded degree, then $ER(H)$ is polynomial in $|V(H)|$ if $H$ is bipartite, but exponential in general. We also study the closely-related problem of constrained Ramsey numbers. For a given tree $S$ and given path $P_t$, we study the minimum $N$ such that every edge-coloring of $K_N$ contains a monochromatic copy of $S$ or a rainbow copy of $P_t$. We prove a nearly optimal upper bound for this problem, which differs from the best known lower bound by a function of inverse-Ackermann type.

Figures (2)

• Figure 1: Illustrations of canonical colorings of a six-vertex clique
• Figure 2: Illustration of the setup of Lemma \ref{['lemma:tournaments']}.