A congruence argument shows Roman's bound is not tight on a long interval below the design threshold, with exact values in a special case.
New bounds for Zarankiewicz numbers via reinforced LLM evolutionary search, 2026
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A congruence obstruction to Roman's bound for Zarankiewicz numbers
A congruence argument shows Roman's bound is not tight on a long interval below the design threshold, with exact values in a special case.