The largest four-cycle-free 43 by 43 bipartite graph has between 284 and 299 edges; a new elementary argument rules out 300 edges.
Title resolution pending
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
-
An Improved Upper Bound on the Zarankiewicz Number z(43;2)
The largest four-cycle-free 43 by 43 bipartite graph has between 284 and 299 edges; a new elementary argument rules out 300 edges.