Recursive-line equality and sharp hole-budget conjectures for second-order Zarankiewicz numbers
For all admissible integers , the second-order Zarankiewicz number equals its recursive-line value: .
References
- Overtake and the recursive-line equality for second-order Zarankiewicz numbers — arXiv — Chen Ouyang, Liqun Qi
Source: arXiv
Progress summary
A recent paper proves a useful lower bound and checks the proposed equality in all currently computed cases, but the main sharp threshold remains conjectural.
The conjectural package concerns equality between second-order and recursive-line Zarankiewicz numbers, together with a sharp threshold derived from a hole budget. The general equality, the sharp threshold, and some equality cases remain unresolved.
Known results
- for all .
- Four-column equality is established at and all , while several cases remain unresolved.
- .
- Additional finite classifications establish equality at selected parameters, including ].
October 2026 claimed progress
Chen Ouyang and Liqun Qi claim that increasing by one costs at least three unoccupied cells, yielding an upper bound on , and that recursive-line equality holds throughout the currently computed range. The sharp hole-budget and threshold conclusions remain conjectural, and the claim has not been independently verified.
Current status (as of October 2026): Several parameter cases and computed ranges are settled, but the general recursive-line equality and the sharp hole-budget threshold remain open; the latest bounds are unverified progress.
Solutions 0
No solutions have been posted yet.