The Erdős–Hajnal conjecture for paths and antipaths

The Erdős–Hajnal conjecture for paths and antipaths

We prove that for every k, there exists ck>0 such that every graph G on n vertices with no induced path Pk or its complement Pk¯ contains a clique or a stable set of size nck.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial theory. Series B 2015-07, Vol.113, p.261-264
Hauptverfasser: Bousquet, N., Lagoutte, A., Thomassé, S.
Format: Artikel
Sprache:eng
Schlagworte:
Antipath
Computer Science
Discrete Mathematics
Erdős–Hajnal
Path
Ramsey
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that for every k, there exists ck>0 such that every graph G on n vertices with no induced path Pk or its complement Pk¯ contains a clique or a stable set of size nck.
ISSN:0095-8956
1096-0902
DOI:10.1016/j.jctb.2015.01.001