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 ...

Gallai–Ramsey theory lies at the intersection of graph colouring and Ramsey theory, providing a framework for understanding how structures emerge in edge-coloured graphs. Central to this domain is the ...