Upper Bounds for Erdös-Hajnal Coefficients of Tournaments

A celebrated unresolved conjecture of Erdös and Hajnal (see Discrete Appl Math 25 (1989), 37–52) states that for every undirected graph H, there exists ε(H)>0, such that every graph on n vertices which does not contain H as an induced subgraph contains either a clique or an independent set of siz...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2013-09, Vol.74 (1), p.122-132
1. Verfasser:	Choromanski, Krzysztof
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms quadratic residue tournaments Studies the Erdös-Hajnal coefficient the Erdös-Hajnal conjecture the probabilistic method transitive tournaments
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!