Computer Science 575 - Combntrcs&Graph Thry
Fall
2018
02
3.00
David Barrington
W F 4:00PM 5:15PM
UMass Amherst
80803
Integ. Learning Center S211
barring@cs.umass.edu
80802,81955
Cross-listed with Math 513. 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 Comp-Sci 250 or Math 455. Math 411 recommended but not required.
MS-CMPSCI students only CROSS-LISTED WITH MATH 513. LECT 01 FOR UNDERGRADS; LECT 02 FOR GRADS. IF NOT MEETING PREREQUISITES, STUDENTS NEEDING INSTRUCTOR PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.