arXiv (All)
open access
A Twelve-Row Seed and a One-Row Extension for Five-Column Recursive-Line Zarankiewicz Numbers
We prove that the five-column recursive-line Zarankiewicz number satisfies $z_{RL}(m,5)=3m+5$ for every integer $m\ge 12$. The proof is based on an explicit $12\times5$ seed configuration combined with a recursive one-row extension scheme. The seed attains the five-column cell bound and contains no
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Recursive-Line Zarankiewicz Numbers with Four Columns#1083231
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)#1033960
- The number-system of algebra treated theoretically and historically (2nd edition)#39285
- Rationality and Quasipolynomiality of Restricted Rectangle Partitions#1071108
- (p,q)- Stirling Numbers of Type B via Signed Restricted Growth Functions and Rook Theory#369645
Record · ID 1117903
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive