Graphs of large linear size are antimagic

Tom Eccles

Given a graph $G=(V,E)$ and a colouring $f:E\mapsto \mathbb{N}$, the induced colour of a vertex $v$ is the sum of the colours at the edges incident with $v$. If all the induced colo…