JaneTan

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 every $t$-intersecting hypergraph has a $c$-strong colouring. In 2012, Blais, Weinstein and Yoshida introduced this parameter and initiated study on when $\chi (t,c)$ is finite: they …