Erdős, Paul; Hajnal, András; Szemeredi, E. On almost bipartite large chromatic graphs. (English) Zbl 0501.05033 Ann. Discrete Math. 12, 117-123 (1982). What can be said about the set of all finite subgraphs of a graph \(G\) when it is known that its chromatic number \(\chi(G)\) is greater than \(\varkappa\), a given finite or infinite cardinal? For finite \(\varkappa\), there are finite graphs \(G\) without any short circuits, but for infinite \(\varkappa\), \(G\) has to contain all finite bipartite graphs. This result from 1966 is here extended in various ways. For instance, bounds are given for the chromatic numbers of the finite subgraphs of \(G\) when special restrictions are imposed on \(G\). Some open problems are also given.For the entire collection see [Zbl 0485.00006]. Reviewer: O.Frank Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 3 Documents MSC: 05C15 Coloring of graphs and hypergraphs Keywords:subgraphs of large graphs; chromatic number; finite bipartite graphs PDFBibTeX XMLCite \textit{P. Erdős} et al., Ann. Discrete Math. 12, 117--123 (1982; Zbl 0501.05033)