Another major open problem in this area is the Erdős-Hajnal conjecture: Theorem 3.
Statement
Another major open problem in this area is the Erdős-Hajnal conjecture: Theorem 3. If G is an induced H-free graph, then G has edit distance at most \varepsilon|V (G)|2 from a graph G′ such that G′ has an induced homomorphism to an in- duced H-free graph F with at most MH (\varepsilon) vertices. Conjecture 4. For each graph H there is c(H) > 0 such that every induced H-free graph on n vertices contains a clique or independent set of size at least nc .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.