We show that the hereditary discrepancy of a hypergraph \( {\user1{\mathcal{F}}} \) on n points increases by a factor of at most O(log n) when one adds a new edge to \( {\user1{\mathcal{F}}} \).
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, J.H., Matoušek, J. & Vu, V.H. Discrepancy After Adding A Single Set. Combinatorica 25, 499–501 (2005). https://doi.org/10.1007/s00493-005-0030-x
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00493-005-0030-x