2 problems

Let $K_p$ be the complete graph on $p$ vertices, and let $f(n,H)$ be the smallest number of colors in an edge coloring of $K_n$ in which every copy of $H$ intersects at least one c…

Let $f_r(n,p,q)$ denote the least number of colours in an $r$-uniform colouring of the complete hypergraph on $n$ vertices with no induced copy of a $p$-vertex hypergraph using at…