collaborators

1 paper

math.CO2025

All graphs are majority 3-choosable

Jan Ouborny, Max Pitz

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.