As others have mentioned, it really depends on how expansive is your definition of major CS theory. In CS research, one finds math results being used from all over the place ranging from dynamical systems to non-monotonic logic.
My guess is first-order logic, set theory, combinatorics/graphs, rigorous probability/analysis, and abstract algebra. At least being familiar with concepts from these areas would help make sense of what's going in, say, complexity theory or cryptography.
I put together a guide to learning complexity theory at the graduate level [0]. This may be a decent proxy for your question.
[0] https://bcmullins.github.io/complexity_theory_resources/