← All problems

Recursive-line equality and sharp hole-budget conjectures for second-order Zarankiewicz numbers

For all admissible integers m,nm,n, the second-order Zarankiewicz number equals its recursive-line value: z2(m,n)=zRL(m,n)z_2(m,n)=z_{RL}(m,n).

References

Progress summary

Refreshed
Open · progress reported

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

  • z2(m,3)=zRL(m,3)=2mz_2(m,3)=z_{RL}(m,3)=2m for all m≥3m\ge 3.
  • Four-column equality is established at m=4,5,6,7,8,13m=4,5,6,7,8,13 and all m≥15m\ge 15, while several cases remain unresolved.
  • z2(15,6)=zSL(15,6)=zRL(15,6)=60z_2(15,6)=z_{SL}(15,6)=z_{RL}(15,6)=60.
  • Additional finite classifications establish equality at selected parameters, including (m,n)=(4,4),(7,4),(8,4),(5,5)(m,n)=(4,4),(7,4),(8,4),(5,5)].

October 2026 claimed progress

Chen Ouyang and Liqun Qi claim that increasing z2z_2 by one costs at least three unoccupied cells, yielding an upper bound on z2A−z2z_2^A-z_2, 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.

Sources

Solutions 0

No solutions have been posted yet.