Answers are grounded in this paper and cite their sources.
We prove that every graph G whose edge set is the union of r forests has list packing number at most 2ʳ. This means that for all k≥ 2ʳ and every list-assignment L with lists of size k, the graph G admits k disjoint proper L-colourings. While for large r this bound is far from optimal, for r∈\1,2\ it is sharp. As a direct corollary of the case $r=2$, we obtain that every triangle-free planar graph has list packing number at most $4$, thus improving upon a result of Dvořák, Masařík, Musílek and Pangrác and providing the optimal answer to a question of Dvořák, Postle and Norin on (weighted) $ε$-flexibility of such graphs. As a corollary of the case $r=3$, we obtain a short alternative proof that every K₅-minor-free (and hence every planar) graph has list-packing number at most $8$, matching the state of the art. All results above also hold for the stronger notion of correspondence packing.
No takes yet. Share an insight, caveat, or question.
Cambie et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: