Jiang–Zhu relaxed multiplication question
For every pair of positive integers and every graph , if is -choosable— that is, every list assignment with for all vertices admits a proper coloring with —then is -choosable— that is, every list assignment with for all vertices admits subsets with such that whenever —.
Equivalent formulations
For every graph , the strong fractional choice number of is at most its choice number.
source: Counterexamples to Relaxed Multiplication in List Coloring
References
- Counterexamples to Relaxed Multiplication in List Coloring — arXiv — Xiaolan Hu, Jiao Li
Source: arXiv
Progress summary
A November 2026 preprint claims to disprove the proposed list-coloring multiplication rule with an explicit small counterexample, but the claim has not been independently checked.
The question asks whether -choosability implies -choosability, equivalently whether the corresponding strong fractional choice-number bound always holds. Jiang and Zhu established important bounds for triangle-free planar graphs, while Dvořák, Hu, and Sereni disproved a broader multiplication principle.
Known results
- Jiang and Zhu proved every triangle-free planar graph is -choosable and exhibited graphs that are not -choosable.
- Dvořák, Hu, and Sereni exhibited a -choosable graph that is not -choosable, refuting general multiplication .
- Hu and Xu proved every triangle-free planar graph is -choosable, answering Jiang–Zhu’s subquestion positively for .
November 2026 counterexample claim
A November 2026 preprint by Xiaolan Hu and Jiao Li, Counterexamples to Relaxed Multiplication in List Coloring, claims an explicit small counterexample to the stronger implication and therefore a negative answer to the equivalent strong fractional choice-number question. The claim currently rests only on that preprint.
Current status (as of November 2026): The stronger implication is claimed to be false, but its counterexample remains unverified; the earlier partial results are established.
Solutions 0
No solutions have been posted yet.