A 1977 conjecture of Erdős and Hajnal [5] predicts a very different behaviour in graphs with a forbidden induced subgraph; formally, their conjecture says that: Conjecture 1…
Statement
A 1977 conjecture of Erdős and Hajnal [5] predicts a very different behaviour in graphs with a forbidden induced subgraph; formally, their conjecture says that: Conjecture 1 (Erdős–Hajnal). This conjecture remains open despite a substantial body of work. Recent work on the Erdős–Hajnal conjecture Tung Nguyen (joint work with Alex Scott, Paul Seymour)
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.