Aside from the obvious exceptions of cliques and odd cycles, Brooks' theorem ensures that the chromatic number of a finite connected graph is bounded by its degree. We establish the analog for Borel graphs on standard probability spaces, where coloring functions are required to be measurable. This is joint work with Andrew Marks and Robin Tucker-Drob.