A graph G contains a graph H if H is isomorphic to an induced subgraph of G, and G is H-free otherwise.
Statement
A graph G contains a graph H if H is isomorphic to an induced subgraph of G, and G is H-free otherwise. Erdős and Hajnal [6, 7] proposed in 1977 the following well-known conjecture, stating that unlike in arbitrary graphs where we can only guarantee a clique or a stable set of polylogarithmic size if we impose even a little bit of structure on the graph, by say forbidding some fixed graph H as an induced subgraph, we are suddenly guaranteed a polynomial-size clique or an independent set. Conjecture 1. For every graph H there exists c ą 0 such that every H-free graph G contains a clique or an independent set of order at least |G|c . Towards the Erdős–Hajnal Conjecture Matija Bucić (joint work with Pablo Blanco and Tung Nguyen, Alex Scott and 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.