arXiv Analytics

Sign in

arXiv:2408.13839 [math.CO]AbstractReferencesReviewsResources

On a question of Erdős and Gimbel on the cochromatic number

Annika Heckel

Published 2024-08-25Version 1

In this note, we show that the difference between the chromatic and the cochromatic number of the random graph $G_{n,1/2}$ is not whp bounded by $n^{1/2-o(1)}$, addressing a question of Erd\H{o}s and Gimbel.

Comments: 4 pages
Categories: math.CO
Subjects: 05C15, 05C80
Related articles: Most relevant | Search more
arXiv:math/0209087 [math.CO] (Published 2002-09-09)
On the non-3-colourability of random graphs
arXiv:1001.0461 [math.CO] (Published 2010-01-04)
Rank-width of Random Graphs
arXiv:1402.6466 [math.CO] (Published 2014-02-26)
Bipartite decomposition of random graphs