Borowiecki–Jozef asymptotic Cartesian product conjecture
Borowiecki–Jozef asymptotic Cartesian product conjecture
From papers
Let and be graphs, and let be a common upper bound for their maximum degrees, so that and . Borowiecki–Jozef's asymptotic conjecture.
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
Sign in to submit a solution.
No solutions have been posted yet.