The Erdös-Hajnal Conjecture-A Survey

The Erdös-Hajnal Conjecture-A Survey

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 article is a survey of some of the known results on this conjecture....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of graph theory 2014-02, Vol.75 (2), p.178-190
1. Verfasser: Chudnovsky, Maria
Format: Artikel
Sprache:eng
Schlagworte:
Erdös-Hajnal conjecture
induced subgraphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 article is a survey of some of the known results on this conjecture.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.21730