On 2-coloring certain k-uniform hypergraphs

We give some sufficient conditions for the existence of a 2-coloring for k-uniform hypergraphs. When the number of edges equals the size of the base set of the hypergraph, these conditions are based on the permanent of the incidence matrix.