A Computational Study of Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs
math.CO2026-05v1license
Abstract
Let denote the incidence graph of the complete graph . We study limited augmented Zarankiewicz numbers in this family by combining exact 0--1 ILP computations for the smallest cases with a constructive search procedure followed by exact admissibility verification in the larger cases considered here. We obtain The first two values are exact. The three lower bounds arise from explicitly verified admissible families with , , and , respectively; the families used to obtain these bounds are nondegenerate in the sense of [8]. In each case, the resulting value improves the corresponding classical Zarankiewicz number and hence strengthens the available lower bounds for BSR(m,n) within this family.
Cite
@article{arxiv.2605.29658,
title = {A Computational Study of Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs},
author = {Xu Yi and Gaohang Yu},
journal= {arXiv preprint arXiv:2605.29658},
year = {2026}
}