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 is not whp bounded by , addressing a question of Erd\H{o}s and Gimbel.
Paper Prompts
Sign up for free to create and run prompts on this paper.