Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1986_01_01_gimbel: The largest cochromatic number of a graph embeddable on the orientable surface of genus n lies between constant multiples of n^{1/2} / log n and n^{1/2}; the lower bound has the right order.
1997_11_01_gimbel_thomassen: The largest cochromatic number of a graph embeddable on the orientable surface of genus n is of order n^{1/2} / log n; refereed in Trans. Amer. Math. Soc. and credited by the site's curator.
Linked from (1)
Graph