The hunt for disjoint list colorings in planar graphs continues, this time together with Daniel Cranston and František Kardoš: https://arxiv.org/abs/2602.16692 Is it possible to find two disjoint L-colorings for every 5-fold list-assignment L? If so, it implies three disjoint L-colorings for every 6-fold L. We proved the latter unconditionally. (More related results on K5-minor-free graphs are in an earlier work together with Cambie and Zhu: https://arxiv.org/abs/2312.17233 )