 Discrepancy of hypergraphs

The discrepancy of hypergraphs is a concept in combinatorial mathematics that deals with how evenly one can color or distribute a set of points (or elements) among different subsets (or hyperedges) of a hypergraph. More formally, it is concerned with the maximum imbalance that can arise when assigning colors, typically two colors, to the vertices of the hypergraph with respect to the hyperedges.