1 research outputs found
Equitable colorings of hypergraphs with few edges
The paper deals with an extremal problem concerning equitable colorings of
uniform hyper\-graph. Recall that a vertex coloring of a hypergraph is
called proper if there are no monochro-matic edges under this coloring. A
hypergraph is said to be equitably -colorable if there is a proper coloring
with colors such that the sizes of any two color classes differ by at most
one. In the present paper we prove that if the number of edges then the hypergraph
is equitably -colorable provided