Abstract
The Erdős-Hajnal conjecture states that for every graph H, there exists a constant δ(H)>0, such that if a graph G has no induced subgraph isomorphic to H, then G contains a clique or a stable set of size at least |V (G)|δ(H). This conjecture is still open. We consider a variant of the conjecture, where instead of excluding H as an induced subgraph, both H and H c are excluded. We prove this modified conjecture for the case when H is the five-edge path. Our second main result is an asymmetric version of this: we prove that for every graph G such that G contains no induced six-edge path, and G c contains no induced four-edge path, G contains a polynomial-size clique or stable set.
Similar content being viewed by others
References
N. Alon, J. Pach, and J. Solymosi: Ramsey-type theorems with forbidden subgraphs, Combinatorica 21 (2001), 155–170.
N. Bousquet, A. Lagoutte and S. Thomassé: The Erdős-Hajnal conjecture for paths and antipaths, submitted for publication.
M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas: The strong perfect graph theorem, Annals of Math 164 (2006), 51–229.
M. Chudnovsky and S. Safra: The Erdős-Hajnal conjecture for bull-free graphs, J. Combin. Theory, Ser. B 98 (2008), 1301–1310.
M. Chudnovsky and Y. Zwols: Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement, to appear in J. Graph Theory.
P. Erdős: Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294.
P. Erdős and A. Hajnal: Ramsey-type theorems, Discrete Applied Mathematics 25 (1989), 37–52.
J. Fox: private communication.
A. Gyárfás: Reflection on a problem of Erdős and Hajnal, in: Mathematics of Paul Erdős, R. L. Graham, J. Nesetřil, editors, Algorithms and Combinatorics, Volumes 13–14, Springer 1997 (vol. 14), 93–98.
L. Lovász: Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics 2 (1972), 253–267.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by NSF grants DMS-1001091 and IIS-1117631.
Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.