COURSE CURRICULUM

The thesis option for the Master of Mathematics in Combinatorics and Optimization requires students to complete four graduate-level courses. This includes two core courses from the Combinatorics and Optimization (C&O) core list, at least one additional C&O course, and a fourth graduate course either within the Faculty of Mathematics or one approved by the C&O Graduate Committee. The core courses provide foundational knowledge and cover essential topics such as CO 630 Algebraic Enumeration, CO 642 Graph Theory, CO 650 Combinatorial Optimization, CO 663 Convex Optimization and Analysis, CO 681 Quantum Information Processing, and CO 685 The Mathematics of Public-Key Cryptography. Students select courses in consultation with their advisors to ensure a well-rounded and specialized education that supports their research interests and thesis work. This structure enables students to gain expertise in both theoretical and applied aspects of combinatorics and optimization, preparing them for advanced research or professional careers. The combination of core and elective courses reflects the interdisciplinary nature of the program and provides flexibility to tailor studies to individual goals while maintaining rigorous academic standards.