Discrepancy of set-systems and matrices
European Journal of Combinatorics
Handbook of combinatorics (vol. 2)
Dispencery in different numbers of colors
Discrete Mathematics
Combinatorics, Probability and Computing
| Hi-index | 0.01 |
We bound the hereditary discrepancy of a hypergraph $\mathcal{H}$ in two colors in terms of its hereditary discrepancy in $c$ colors. We show that $\mathrm{herdisc}(\mathcal{H},2)\leq Kc$ $\mathrm{herdisc}(\mathcal{H},c)$, where $K$ is some absolute constant. This bound is sharp apart from the absolute constant.