On a question of Erdős and Gimbel on the cochromatic number
The electronic journal of combinatorics, Tome 31 (2024) no. 4
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ős and Gimbel.
DOI :
10.37236/13346
Classification :
05C15, 05C80
Mots-clés : cochromatic number, complete graph
Mots-clés : cochromatic number, complete graph
Affiliations des auteurs :
Annika Heckel  1
@article{10_37236_13346,
author = {Annika Heckel},
title = {On a question of {Erd\H{o}s} and {Gimbel} on the cochromatic number},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {4},
doi = {10.37236/13346},
zbl = {1556.05047},
url = {http://geodesic.mathdoc.fr/articles/10.37236/13346/}
}
Annika Heckel. On a question of Erdős and Gimbel on the cochromatic number. The electronic journal of combinatorics, Tome 31 (2024) no. 4. doi: 10.37236/13346
Cité par Sources :