Improved Approximation for Maximum Edge Colouring Problem

L Sunil Chandran, Abhiruk Lahiri, Nitin Singh

The anti-Ramsey number, $ar(G,H)$ is the minimum integer $k$ such that in any edge colouring of $G$ with $k$ colours there is a rainbow subgraph isomorphic to $H$, i.e., a copy of…