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)}.
Board: The Erdős–Hajnal conjecture
Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.
0 open issues, 0 that nobody works on, 0 worked on; 1 open pull request.
main at 6a9b818: no checks on it yet.