A vertex colouring of a hypergraph is $c$-strong if every edge $e$ sees at least $min\{c,|e|\}$ distinct colours. Let $\chi (t,c)$ denote the least number of colours needed so that …