@inproceedings{Erds1982OnAB,
title={On Almost Bipartite Large Chromatic Graphs},
author={Paul Erdős and Andr{\'a}s Hajnal and Endre Szemer{\'e}di},
year={1982}
}

In the past we have published quite a few papers on chromatic numbers of graphs (finite or infinite), we give a list of those which are relevant to our present subject in the references . In this paper we will mainly deal with problems of the following type : Assuming that the chromatic number x(1) of a graph is greater than K, a finite or infinite cardinal, what can be said about the behaviour of the set of all finite subgraphs of 9 . We will investigate this problem in case some other… CONTINUE READING