New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search

Jay Bhan, Nicole Nobili, Patrick Langer

The Zarankiewicz number $\text{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 det…