Skip top navigation

MATH 641: Combinatorics and Graph Theory

Important: For the most up-to-date information, refer to the official George Mason Course Catalog

General Information

Credits: 3


Covers enumerative combinatorics, including partially ordered sets; Moebius inversion and generating functions; and major topics in graph theory such as graph coloring, Ramsey theory, and matching. Offered by Mathematics. May not be repeated for credit.
Recommended Prerequisite: MATH 321 or equivalent.
Registration Restrictions:

Enrollment limited to students with a class of Advanced to Candidacy, Graduate, Junior Plus, Non-Degree or Senior Plus.

Enrollment is limited to Graduate, Non-Degree or Undergraduate level students.

Students in a Non-Degree Undergraduate degree may not enroll.

Schedule Type: Lecture
This course is graded on the Graduate Regular scale.