For a hypergraph let $\chi$ be the least number of colours needed to colour the vertices, so that in each edge, each colour is used at most once (i.e., the *strong* chromatic number). Let $\Delta$ be the maximum number of hyperedges containing any vertex. Let $\omega$ be the maximum size of a *clique*, meaning a vertex set such that for every pair of vertices in the clique, some edge contains both.

**Question**: is there $\epsilon>0$ so that $\chi \le \Delta \omega / (1+\epsilon)$ in all hypergraphs?

Motive: let $R$ be the maximum edge size. A simple greedy algorithm for colouring can be used to establish that $\chi \le 1 + \Delta(R-1)$, and this bound cannot be improved in general. Note $\chi \ge \omega \ge R$; so I am essentially asking if $\omega$ approximates $\chi$ more closely than $R$.