We present a unified proof and certificate package establishing seven exact finite Zarankiewicz values for the forbidden graph : , , , , , , and . The witnesses form a connected family generated by an explicit 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, , combines the published uniqueness of the extremal graph with 103 edges and an exhaustive rejection of all 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本