Abstract
We bound the hereditary discrepancy of a hypergraph H in two colors in terms of its hereditary discrepancy in c colors. We show that herdisc(H, 2) ≤ Kc herdisc(H, c), where K is some absolute constant. This bound is sharp apart from the absolute constant.
| Original language | English |
|---|---|
| Pages (from-to) | 1205-1213 |
| Number of pages | 9 |
| Journal | SIAM Journal on Discrete Mathematics |
| Volume | 24 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 26 Oct 2010 |
| Externally published | Yes |
Keywords
- Coloring of hypergraphs
- Discrepancy
- Hypergraphs
Fingerprint
Dive into the research topics of 'Hereditary discrepancies in different numbers of colors II'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver