Subgraphs with a Large Cochromatic Number

Noga Alon*, Michael Krivelevich, Benny Sudakov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The cochromatic number of a graph G = (V, E) is the smallest number of parts in a partition of V in which each part is either an independent set or induces a complete subgraph. We show that if the chromatic number of G is n, then G contains a subgraph with cochromatic number at least Ω(n/lnn). This is tight, up to the constant factor, and settles a problem of Erdos and Gimbel.

Original languageEnglish
Pages (from-to)295-297
Number of pages3
JournalJournal of Graph Theory
Volume25
Issue number4
DOIs
StatePublished - Aug 1997

Keywords

  • Chromatic number
  • Graph coloring
  • Ramsey theory

Fingerprint

Dive into the research topics of 'Subgraphs with a Large Cochromatic Number'. Together they form a unique fingerprint.

Cite this