The Erd\"os-Hajnal Conjecture---A Survey

Maria Chudnovsky

The Erd\"os-Hajnal Conjecture---A Survey

Combinatorics 2016-06-29 v1

Authors: Maria Chudnovsky

Abstract

The Erd\"os-Hajnal conjecture states that for every graph $H$ , there exists a constant $\delta(H) > 0$ such that every graph $G$ with no induced subgraph isomorphic to $H$ has either a clique or a stable set of size at least $|V(G)|^{\delta(H)}$ . This paper is a survey of some of the known results on this conjecture.

Keywords

Erdős-Hajnal conjecture induced subgraph clique stable set Ramsey theory graph theory

Cite

@article{arxiv.1606.08827,
  title  = {The Erd\"os-Hajnal Conjecture---A Survey},
  author = {Maria Chudnovsky},
  journal= {arXiv preprint arXiv:1606.08827},
  year   = {2016}
}

Related papers

View all related →