On a Question of Erdős and Gimbel on the Cochromatic Number

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.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2024-12-26
DOI
https://doi.org/10.37236/13346
Citations
1
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.36

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On a Question of Erdős and Gimbel on the Cochromatic Number

Annika Heckel
1 citations
The Electronic Journal of Combinatorics
Computability, Logic, AI Algorithms
0.36
article

On a Question of Erdős and Gimbel on the Cochromatic Number

Annika Heckel
article en
1 citations

Abstract

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.

The Electronic Journal of CombinatoricsVol. 31(4)
LMU Klinikum (DE), Ludwig-Maximilians-Universität München (DE)
Vetenskapsrådet
Openalex Percentile: Top 32%
Computability, Logic, AI Algorithms
0.36
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On a Question of Erdős and Gimbel on the Cochromatic Number — Annika Heckel · The Electronic Journal of Combinatorics (2024) | TGRS Research Map | TGRS