Mathematics 513 - Combinatorics
Fall
2016
01
3.00
David Barrington
M W F 10:10AM 11:00AM
UMass Amherst
74837
80145,80146
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.
Pre Req: CMPSCI 250orMATH455wB Students requesting permission to enroll must request an override to COMPSCI 575 via the online form www.cics.umass.edu/overrides .
Students may only request an override to one of COMPSCI 575 OR MATH 513; not both.
Students may only request an override to one of COMPSCI 575 OR MATH 513; not both.