2 problems

Let $K_n$ be the complete graph on $n$ vertices with its edges colored using three colors. Let $F(G)$ be the number of rainbow triangles in a coloring $G$, and let … A coloring is…

Let $r$ and $t$ be positive integers, and let $r(t)$ denote the two-color Ramsey number: the least integer $m$ such that every $2$-coloring of the edges of the complete graph on…