The paper proves bs(k) ≤ g(k)+2 for k-uniform hypergraphs, determines bs(k)=3 for 3≤k≤13, and improves the known upper bound from k+1 to O(k^{0.525}).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Relative discrepancy of hypergraphs
The paper proves bs(k) ≤ g(k)+2 for k-uniform hypergraphs, determines bs(k)=3 for 3≤k≤13, and improves the known upper bound from k+1 to O(k^{0.525}).