Hereditary Discrepancies in Different Numbers of Colors II
classification
💻 cs.DM
keywords
colorshereditarybounddiscrepancyherdiscabsoluteconstantdifferent
read the original abstract
We 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.