MathDB1 problem
Minimum-degree four conjecture. Every graph with minimum degree at least admits a majority edge colouring from lists of size .
Minimum-degree four conjecture. Every graph with minimum degree at least admits a majority edge colouring from lists of size .