n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.
arXiv:2509.00721 [cs.DS]
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sharp bounds for covering with large cliques and independent sets
n(k1, k2) equals 2k1 + 2k2 - 4, proving the diagonal case conjecture and establishing the matching lower bound in general.