Discrepancy After Adding A Single Set

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}}} \).

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Jeong Han Kim.

Rights and permissions

Reprints 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

Download citation

Mathematics Subject Classification (2000):

  • 05D40