Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 25 Aug 2024 in math.CO | (2408.13839v2)

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

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.