, Volume 19, Issue 2, pp 267–296

Mangoes and Blueberries

Original Paper

DOI: 10.1007/s004930050056

Cite this article as:
R, B. Combinatorica (1999) 19: 267. doi:10.1007/s004930050056

Dedicated to the memory of Paul Erdős

We prove the following conjecture of Erdős and Hajnal:

For every integer k there is an f(k) such that if for a graph G, every subgraph H of G has a stable set containing \(\) vertices, then G contains a set X of at most f(k) vertices such that GX is bipartite.

This conjecture was related to me by Paul Erdős at a conference held in Annecy during July of 1996. I regret not being able to share the answer with him.

Copyright information

© János Bolyai Mathematical Society, 1999

Authors and Affiliations

  • Bruce R
    • 1
  1. 1.CNRS; Paris, France; and IME-USP; Sao Paulo, Brasil; E-mail: reed@ecpb.jussieu.frFR