Mathematics 513 - Combinatorics
Fall
2022
01
3.00
Marius Minea
TU TH 1:00PM 2:15PM
UMass Amherst
55997
Morrill 2 Room 222
marius@cs.umass.edu
55994,55995
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 majors only. COMPSCI 250 or math 255 w/ B