arXiv (All)
open access
Asymptotic equivalence and exact values for second-order Zarankiewicz numbers
The recursive-line and signed Zarankiewicz numbers maximize the number of squares in augmentations of a maximum $C_4$-free base, subject to two sufficient irreducibility criteria. The count includes one square per base cell and one per selected pair of unused cells. We compare these parameters with
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
- Exact Values, Extremal Classifications, and Sum-of-Squares Reductions for Second-Order Zarankiewicz Numbers#1012615
- A Short Proof of a Conjecture Regarding Quadratic Representations of Practical Numbers#1123195
- Energy bounds for modular roots and their applications#1232548
- A Short Proof of a Theorem of Pan and Zhang#1141830
- On digit-appending walks along linear recurrences#1344742
Record · ID 1201455
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