The Erdös-Hajnal Conjecture - A Survey

@article{Chudnovsky2014TheEC,
  title={The Erd{\"o}s-Hajnal Conjecture - A Survey},
  author={M. Chudnovsky},
  journal={J. Graph Theory},
  year={2014},
  volume={75},
  pages={178-190}
}
  • M. Chudnovsky
  • Published 2014
  • Mathematics, Computer Science
  • J. Graph Theory
The Erdos-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 leastjV (G)j (H) . This paper is a survey of some of the known results on this conjecture. 
The Erdős-Hajnal conjecture for paths and antipaths
We prove that for every k, there exists c k 0 such that every graph G on n vertices with no induced path P k or its complement P k ? contains a clique or a stable set of size n c k .
String graphs have the Erdős-Hajnal property
A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant c > 0 such that if G is a string graph on n vertices, then G contains either a cliqueExpand
Sparse graphs without linear anticomplete pairs
We prove that for every graph H there exists c>0 such that, for every graph G, if G has no clique or stable set of size |G|^c, then either G or its complement contains an induced subdivision of H.Expand
An algorithmic weakening of the Erdős-Hajnal conjecture
TLDR
It is shown that there is a constant c such that MIS in graphs of girth γ cannot be n c γ -approximated, which is the first strong inapproximability result for Maximum Independent Set in a proper hereditary class. Expand
A note on the Erd\H{o}s-Hajnal property for stable graphs
In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M.Expand
String graphs have the Erd\H{o}s-Hajnal property
A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either aExpand
The Erdös-Hajnal Conjecture for Long Holes and Antiholes
TLDR
It is proved that for every $k$ there exists a constant c_k>0 such that every graph G on n vertices not inducing a cycle of length at least k nor its complement contains a clique or a stable set of size at least $n^{c_k}$. Expand
The Erdős-Hajnal conjecture for rainbow triangles
We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order ? ( n 1 / 3 log 2 ? n ) which uses at most two colors, and thisExpand
Erdős-Hajnal-type results for monotone paths
Abstract An ordered graph is a graph with a linear ordering on its vertex set. We prove that for every positive integer k, there exists a constant c k > 0 such that any ordered graph G on n verticesExpand
Two Erdős-Hajnal-type theorems in hypergraphs
TLDR
It is proved that if a 3-uniform hypergraph is non-universal then it contains an almost homogeneous set of size Ω ( log ⁡ n) and an application of this lemma improves a bound of Conlon–Fox–Sudakov by showing that R 3 ( t ) ≥ t Ω( t ) . Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Almost All F-Free Graphs Have The Erdos-Hajnal Property
Erdős and Hajnal conjectured that, for every graph H, there exists a constant ɛ(H) > 0 such that every H-free graph G (that is, not containing H as an induced subgraph) must contain a clique or anExpand
The Erdös-Hajnal conjecture for bull-free graphs
TLDR
It is proved that every bull-free graph on n vertices contains either a clique or a stable set of size n^1^4, thus settling the Erdos-Hajnal conjecture. Expand
Ramsey-type Theorems with Forbidden Subgraphs
TLDR
This work answers the question in the affirmative that for every graph H, there exists an such that any H-free graph with n vertices contains either a complete or an empty subgraph of size at least and establishes several Ramsey type results for tournaments. Expand
Excluding paths and antipaths
TLDR
An asymmetric version of the Erdős-Hajnal conjecture, where instead of excluding H as an induced subgraph, both H and Hc are excluded, is proved: for every graph G such that G contains no induced six-edge path, G contains a polynomial-size clique or stable set. Expand
Upper Bounds for Erdös-Hajnal Coefficients of Tournaments
TLDR
It is proved that there exists such that the Erdos–Hajnal coefficient of almost every tournament T on k vertices is at most, i.e. the proportion of tournaments on k Vertices with the coefficient exceeding goes to 0 as k goes to infinity. Expand
Forcing large transitive subtournaments
TLDR
This paper proves the conjecture for an infinite class of tournaments that is not obtained by the so-called substitution operations, and shows that the conjecture is satisfied by every tournament on at most 5 vertices. Expand
On a property of the class of n-colorable graphs
Abstract An obvious lower bound on the chromatic number of a graph is the largest possible number of points in a complete subgraph. A sufficient condition is presented for these numbers to be equal.Expand
Ramsey-type theorems
Abstract In this paper we will consider Ramsey-type problems for finite graphs, r -partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic)Expand
The Strong Perfect Graph Theorem
A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle ofExpand
Extending the Gyárfás-Sumner conjecture
TLDR
A complete characterization of the finite heroic sets is given and a bound on the maximum number of vertices in any graph that is minimal not k-split is proved, first proved by Gyarfas and for which a short proof is given. Expand
...
1
2
3
4
...