erdős #759
The cochromatic number of , denoted by , is the minimum number of colours needed to colour the vertices of such that each colour class induces either a complete graph or empty graph. Let be the maximum value of over all graphs which can be embedded on , the orientable surface of genus . Determine the growth rate of .
Worked, still open.
graph theory · solved · possible · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems