6 citations · 7 across the 2 of their papers we have counts for
2 papers
math.PR2016★ 1 cited
Clique colouring of binomial random graphs
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
A clique colouring of a graph is a colouring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colours in such a colou…
math.CO2016★ 6 cited
On some multicolour Ramsey properties of random graphs
Andrzej Dudek, Paweł Prałat
The size-Ramsey number of a graph is the smallest integer such that there exists a graph on edges with the property that any colouring of the edges of…