Computer Science 575 - Combntrcs&Graph Thry
Fall
2016
02
3.00
David Barrington
M W F 10:10AM 11:00AM
UMass Amherst
80146
74837,80145
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-CMPSC students only CROSS-LISTED WITH MATH 513. LECT 01=UG; LECT 02=GRADS. IF NOT MEETING PREREQUISITES, STUDENTS NEEDING INSTRUCTOR PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cs.umass.edu/overrides.