Every graph is majority 3-choosable. This generalises the result by Shelah-Milner that every graph has an unfriendly 3-partition, confirming a conjecture of Haslegrave from 2020.
@article{arxiv.2505.06031,
title = {All graphs are majority 3-choosable},
author = {Jan Ouborny and Max Pitz},
journal= {arXiv preprint arXiv:2505.06031},
year = {2025}
}