The perfect-induced-subgraph formulation of the Erdős–Hajnal conjecture
Statement
All graphs are finite and simple. A graph is perfect if every induced subgraph of satisfies , where is its chromatic number and its maximum clique size. A graph is -free if it has no induced subgraph isomorphic to .
Perfect-subgraph formulation. For every graph , there exists a constant , such that every -free graph has a perfect induced subgraph with at least vertices.
This is an equivalent formulation of the Erdős–Hajnal conjecture: a perfect graph on vertices contains a clique or stable set of size at least . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.