Induced Ramsey numbers for fans

Abstract

The induced Ramsey number $r_{\mathrm{ind}}(G,H)$ is defined as the minimum order of a graph $F$ on such that any 2-coloring of its edges with red and blue leads to either a red induced copy of $G$ or a blue induced copy of $H$. Motivated by the Kohayakawa-Prömel-Rödl conjecture, we prove that a quadratic upper bound $\mathrm{r}_{\text {ind}}\left(G, F_n\right) \leq C n^2$ for fixed $G$, where $F_n$ is a graph with one central vertex, $2n$ leaf vertices, and $n$ disjoint edges. In particular, for star graphs $K_{1, \ell}$ $(\ell \leq n)$, constructive coloring and matching arguments yield $2 n+2 \ell-1 \leq \mathrm{r}_{\text {ind}}\left(K_{1, \ell}, F_n\right) \leq(\ell+n-1)(\ell+1)+1$, with the exact value $\mathrm{r}_{\text {ind}}\left(K_{1,2}, F_n\right)=3 n+4$.

Figures (1)

• Figure 1: Illustration of conflict between copies $A$ and $B$ in $R_{0}$.

Theorems & Definitions (26)

• Definition 1.1
• Definition 1.2
• Conjecture 1
• Theorem 1.1
• Theorem 1.2
• Theorem 1.3
• Theorem 1.4
• Lemma 2.1
• proof
• Lemma 4.1