The asymptotic Zarankiewicz conjecture for crossing numbers

About 6 years old · traced to

Let cr(Kn,n)cr(K_{n,n}) be the crossing number of the complete bipartite graph Kn,nK_{n,n}, and let cr0(Kn,n)cr_0(K_{n,n}) be its geodesic crossing number. Define

λ:=lim⁡n→∞n−4cr(Kn,n)\lambda:= \lim_{n\to\infty} n^{-4} cr(K_{n,n})

and

λ0:=lim⁡n→∞n−4cr0(Kn,n).\lambda_0:= \lim_{n\to\infty} n^{-4} cr_0(K_{n,n}).

The limits exist, and satisfy λ≤λ0≤116\lambda \leq \lambda_0 \leq \tfrac{1}{16}. Asymptotic Zarankiewicz conjecture.

λ=λ0=116.\lambda = \lambda_0 = \tfrac{1}{16}.

This conjecture asserts that the Zarankiewicz construction is asymptotically optimal both for the usual crossing number and for the geodesic crossing number. The source states that the conjecture remains open.

References

Primary source

Marthe Bonamy, Bojan Mohar and Alexandra Wesolek, “Limiting crossing numbers for geodesic drawings on the sphere”, arXiv:2008.10459 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.