Borowiecki–Jozef asymptotic Cartesian product conjecture

From papers

Let G1G_1 and G2G_2 be graphs, and let Δ\Delta be a common upper bound for their maximum degrees, so that Δ(G1)Δ\Delta(G_1)\leq\Delta and Δ(G2)Δ\Delta(G_2)\leq\Delta. Borowiecki–Jozef's asymptotic conjecture.

χ(G1G2)Δ+o(Δ).\chi_\ell(G_1\Box G_2)\leq\Delta+o(\Delta).

This is the second Cartesian-product conjecture stated in the supplied text; its resolution is not given.

Progress summary

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

Sources & referencesView supporting material

Primary source

Nandana K Vasudevan, K Somasundaram and N Narayanan, “List-Coloring and Chromatic-Choosability – A Dynamic Survey”, arXiv:2606.31702 (2026).

Solutions 0

No solutions have been posted yet.