Let $H = (V, E)$ be a hypergraph such that every member of $E$ has more than $1$ element. Let $\kappa$ be a cardinal. We say that $c: V\to \kappa$ is a weak coloring if for all $e \in E$ the restriction $c|_e$ is not constant. We call $c$ a strong coloring, if for all $e \in E$ the restriction $c|_e$ is injective. We let $\chi_w(H)$ be the smallest cardinal such that there is a weak coloring to that cardinal, and we define $\chi_s(H)$ similarly for strong colorings.

Suppose all $e\in E$ have finitely many elements. Is it possible that $\chi_w(H) < \aleph_0$ but $\chi_s(H) \geq \aleph_0$?

Let $H = (V, E)$ be a hypergraph such that every member of $E$ has more than $1$ element. Let $\kappa$ be a cardinal. We say that $c: V\to \kappa$ is a weak coloring if for all $e \in E$ the restriction $c|_e$ is not constant. We call $c$ a strong coloring, if for all $e \in E$ the restriction $c|_e$ is injective. We let $\chi_w(H)$ be the smallest cardinal such that there is a weak coloring to that cardinal, and we define $\chi_s(H)$ similarly for strong colorings.

Suppose all $e\in E$ have finitely many elements. (I.e., $H$ has finite rank^(*).) We do not require that $H$ be uniform. Is it possible that $\chi_w(H) < \aleph_0$ but $\chi_s(H) \geq \aleph_0$?

${}$____________________________

^(*) Cf. e.g. page 2 in [C. Berge, Hypergraphs, North Holland, 1989, ISBN 0 444 87489 5].