On Generalised Majority Edge-Colourings of Graphs

• Published in: The Electronic journal of combinatorics Vol. 31; no. 4
• Main Authors: Pękała, Paweł, Przybyło, Jakub
• Format: Journal Article
• Language: English
• Published: 17.12.2024

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}{k}$'th of the edges incident with $v$ have colour $i$. We conjecture that for every integer $k\geq 2$, each graph...