SEARCH

SEARCH BY CITATION

Keywords:

  • induced subgraphs;
  • Erdös–Hajnal conjecture

Abstract

The Erdös–Hajnal conjecture states that for every graph H, there exists a constant inline image such that every graph G with no induced subgraph isomorphic to H has either a clique or a stable set of size at least inline image. This article is a survey of some of the known results on this conjecture.