Mathematics 513 - Combinatorics

Fall
2025
01
3.00
Paul Gunnells

TU TH 10:00AM 11:15AM

UMass Amherst
64889
Lederle Grad Res. Ctr rm A201
gunnells@umass.edu
69954,69955
Cross-listed with CompSci 575. A basic introduction to combinatorics and graph theory for advanced students in computer science, mathematics, and related fields. Topics include elements of graph theory, Euler and Hamiltonian circuits, graph coloring, matching, basic counting methods, generating functions, recurrences, inclusion-exclusion, Polya's theory of counting. Prerequisites: mathematical maturity, calculus, linear algebra, discrete mathematics course such as CompSci 250 or Math 455. Math 411 recommended but not required.

Open to MATH and STATDS students. COMPSCI 250 or math 255 w/ B Math majors or Stat and DS majors only

Permission is required for interchange registration during the add/drop period only.
Link to Campus Courses
Back to the Five College Course Schedule