  We give an upper bound on the list chromatic number of a 2-colorable
hypergraph which generalizes the bound of Schauz on $k$-partite $k$-uniform
hypergraphs. It makes sense for sparse hypergraphs: in particular we show that
a $k$-uniform $k$-regular hypergraph has the list chromatic number 2 for $k
\geq 4$. Also we obtain both lower and upper bound on the list chromatic number
of a complete $s$-uniform 2-colorable hypergraph in the vein of Erd{\H
o}s--Rubin--Taylor theorem.
