ProbXiv
Explorersign in
Problem archiveProblem record

Statement

All graphs are finite and simple. A graph GG is perfect if every induced subgraph HH of GG satisfies χ(H)=ω(H)\chi(H)=\omega(H), where χ(H)\chi(H) is its chromatic number and ω(H)\omega(H) its maximum clique size. A graph is HH-free if it has no induced subgraph isomorphic to HH.

Perfect-subgraph formulation. For every graph HH, there exists a constant ψ(H)>0\psi(H) > 0, such that every HH-free graph GG has a perfect induced subgraph with at least ∣V(G)∣ψ(H)|V(G)|^{\psi(H)} vertices.

This is an equivalent formulation of the Erdős–Hajnal conjecture: a perfect graph on mm vertices contains a clique or stable set of size at least m\sqrt m. The formulation replaces two possible outcomes by one and is useful for inductive arguments; it remains open in general.

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.