Colouring random graphs and maximising local diversity

S. Bounkong, J. van Mourik, D. Saad

We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours…