Nearly bipartite graphs with large chromatic number

Abstract

P. Erd6s and A. Hajnal asked the following question. Does there exist a constant e>0 with the following property : If every subgraph H of a graph G can be made bipartite by the omission of at most e I HI edges where I H I denotes the number of vertices of H then Z (H) <= 3. The aim of this note is to give a negative answer to this question and consider the… (More)
DOI: 10.1007/BF02579434

Topics

Cite this paper

@article{Rdl1982NearlyBG, title={Nearly bipartite graphs with large chromatic number}, author={Vojtech R{\"o}dl}, journal={Combinatorica}, year={1982}, volume={2}, pages={377-383} }