New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search
arXiv:2605.01120v1 Announce Type: new
Abstract: The Zarankiewicz number $\textbf{Z}(m, n, s, t)$ is the maximum number of edges in a bipartite graph $G_{m, n}$ such that there is no complete $K_{s, t}$ bipartite subgraph. We determine for the first ti…