On generalised majority edge-colourings of graphs

Paweł Pękała, Jakub Przybyło

A $\frac{1}{k}$-majority $l$-edge-colouring of a graph $G$ is a colouring of its edges with $l$ colours such that for every colour $i$ and each vertex $v$ of $G$, at most $\frac{1}…