Discrepancy of hypergraphs

Discrepancy of hypergraphs is an area of discrepancy theory that studies the discrepancy of general set systems. == Definitions == In the classical setting, we aim at partitioning the vertices of a hypergraph H = ( V , E ) {\displaystyle {\mathcal {H}}=(V,{\mathcal {E}})} into two classes in such a way that ideally each hyperedge contains the same number of vertices in both classes.

This neuron ends here.