ProbXiv
Explorersign in
Problem archiveProblem record

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.