Subgraphs with a large cochromatic number

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

[1]  Jessica Engel,et al.  Problem , 1902 .

[2]  Paul Erdös,et al.  Some extremal results in cochromatic and dichromatic theory , 1991, J. Graph Theory.

[3]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[4]  P. Erdös,et al.  Some Problems and Results in Cochromatic Theory , 1993 .

[5]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[6]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.