Mathematics 513 - Combinatorics
Spring
2022
01
3.00
Alejandro Henry Morales Borrero
TU TH 11:30AM 12:45PM
UMass Amherst
32289
Lederle Grad Res Tower rm 219
amoralesborr@umass.edu
37006,37007
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.
COMPSCI 250 or math 255 w/ B Note: 25 seats are reserved for Math Majors and 5 seats are reserved for Compsci Majors
To submit an override request, please visit: https://goo.gl/forms/njwWgVZjhsjWDP1y2