Erdős Problem #805 — For which functions g(n) with n>g(n)≥ (log n)^2 is there a graph on n vertices in which every induced subgraph on g(n) vertices contains a clique of size ≥ log n and an independent s…
Statement
For which functions with is there a graph on vertices in which every induced subgraph on vertices contains a clique of size and an independent set of size ? In particular, is there such a graph for ?
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.