{"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","summary":"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;…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-16","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}