The Erdős–Hajnal conjecture
Show that graphs avoiding a fixed induced subgraph H always contain a clique or independent set of size n^{c(H)}.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No closed issues
Issues hold questions, sub-problems and requests for help.