Search arXivSearch

arXiv · 2608.08549

Seven Exact Finite Zarankiewicz Numbers from a Single 13 x 18 Core

Abstract

We present a unified proof and certificate package establishing seven exact finite Zarankiewicz values for the forbidden graph $K_{3,3}$: $z(12,18;3)=108$, $z(13,17;3)=110$, $z(13,18;3)=116$, $z(14,17;3)=118$, $z(14,18;3)=124$, $z(15,17;3)=126$, and $z(15,18;3)=132$. The witnesses form a connected family generated by an explicit $13 \times 18$ matrix with 116 ones. Deleting one row or one column and adding either of exactly two admissible weight-eight rows for this fixed labeled core produces the remaining witnesses. The exceptional upper-bound closure, $z(12,18;3)\leq108$, combines the published uniqueness of the extremal $12 \times 17$ graph with 103 edges and an exhaustive rejection of all $\binom{12}{6}=924$ possible degree-six column extensions. The supplement contains all witnesses, a portable verifier, a machine-readable report, and integrity hashes. Prior numerical ingredients and the role of the present work are separated cell by cell.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shengteng Hou. 2026-08-09. Seven Exact Finite Zarankiewicz Numbers from a Single 13 x 18 Core. https://arxiv.org/abs/2608.08549

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO