On a question of Erdos and Gimbel on the cochromatic number
Abstract
In this note, we show that the difference between the chromatic and the cochromatic number of the random graph Gn,1/2 is not whp bounded by n1/2-o(1), addressing a question of Erdos and Gimbel.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.