MATH 262B
Further Topics in Combinatorial Mathematics
Continued development of a topic in combinatorial mathematics. Topics include problems of enumeration, existence, construction, and optimization with regard to finite sets. Recommended preparation: some familiarity with computer programming desirable but not required. May be taken for credit three times with consent of adviser as topics vary. Prerequisites: MATH 262A. Students who have not completed MATH 262A may enroll with consent of instructor.
Topics
- problems of enumeration
- existence
- construction
- and optimization with regard to finite sets
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027