Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...