Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...