Homemath.COarXiv:2605.29658

A Computational Study of Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs

math.CO2026-05v1license

Abstract

Let G1G_1 denote the incidence graph of the complete graph Kq+1K_{q+1}. 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 zL(6,4)=14,zL(10,5)=26,zL(15,6)43,zL(21,7)64,zL(28,8)88. z_L(6,4)=14,\qquad z_L(10,5)=26,\qquad z_L(15,6)\ge 43,\qquad z_L(21,7)\ge 64,\qquad z_L(28,8)\ge 88. The first two values are exact. The three lower bounds arise from explicitly verified admissible families with E2=13|E_2|=13, E2=22|E_2|=22, and E2=32|E_2|=32, 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}
}