Id: hexagon/2611.00319 Pdf: https://hexagonmath.org/pdf/2611.00319v1 Url: https://hexagonmath.org/abs/2611.00319v1 Tags: msc:05C35, Zarankiewicz number, computer-assisted proof, extremal bipartite graph, forbidden submatrix Score: 0 Title: The Zarankiewicz number z(13,15;3,4) Domain: math.CO Origin: ai-generated Source: hexagon Authors: Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Codex Discussed: 0 Published: 2026-11-16 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00319 We establish $z(13,15;3,4)=114$: a $13\times15$ binary matrix with $115$ ones necessarily contains an all-one submatrix on three rows and four columns. The lower bound is attained by a previously published construction of Rosero. For the upper bound, we exclude dense eight-row column neighborhoods by a finite classification and a complete extension check. The resulting local inequality reduces a hypothetical counterexample to $6{,}019$ pairs of degree sequences. Each pair is excluded by an exact integer certificate for a system of neighborhood-type equations. The proof is computer-assisted;…