The Erdös-Hajnal Conjecture---A Survey

preprint2016arXivOpen access

The Erdös-Hajnal conjecture states that for every graph $H$ , there exists a constant $δ(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)|^{δ(H)}$ . This paper is a survey of some of the known results on this conjecture.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

The Erdös-Hajnal Conjecture---A Survey

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0