2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/118872We bound the hereditary discrepancy of a hypergraph $\HH$ in two colors in terms of its hereditary discrepancy in $c$ colors. We show that $\herdisc(\HH,2) \le K c \herdisc(\HH,c)$, where $K$ is some absolute constant. This bound is sharp.Discrete MathematicsG.2.2text