Coloring triangles in graphs

Abstract

We study quantitative aspects of the following fact: For every graph $F$, there exists a graph $G$ with the property that any $2$-coloring of the triangles of $G$ yields an induced copy of $F$, in which all triangles are monochromatic. We define the Ramsey number $R_{\text{ind}}^{\hat{I}}”(F)$ as the smallest size of such a graph $G$. Although this fact has several proofs, all of them provide tower-type bounds. We study the number $R_{\text{ind}}^{\hat{I}}”(F)$ for some particular classes of graphs $F$.

23 pages, comments are welcome