Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Brooks' theorem

Except for complete graphs and odd cycles, every connected graph can be properly colored with no more colors than its largest degree.

Brooks' theorem: if $G$ is connected, not a complete graph, and not an odd cycle, then $\chi(G) \le \Delta(G)$ (theorem: brooks-theorem).