arXiv (All)
open access
Exact Second-Order Zarankiewicz Numbers for Complete-Graph Incidence Families
Let $n\ge6$, $m=\binom n2$, and consider the complete-graph incidence family on $K_n$: columns are vertices, rows are edges, and the one-edge graph is the incidence graph. We study the second-order, signed, and recursive-line Zarankiewicz numbers $z_2,z_{SL},z_{RL}$ of this family. The universal cel
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
- A dimer view on Fox's trapezoidal conjecture#785096
- A dimer view on Fox's trapezoidal conjecture#783506
- Optimization Models and Computational Bounds for Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs#670605
- Optimization Models and Computational Bounds for Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs#668540
- Kaczki#781312
Record · ID 1061879
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