2 problems

Let $H$ be a $3$-uniform hypergraph, let $K_n^3$ be the complete $3$-uniform hypergraph on $n$ vertices, and let $r(H,K_n^3)$ be the corresponding Ramsey number. Call $H$ iterated…

Let $g_3(s)$ denote the maximum number of edges in an $s$-vertex iterated blowup of a $3$-uniform edge, and let $r_3(s,e;t)$ be the corresponding hypergraph Ramsey number. Conjectu…