COMPSCI 575/MATH 513: Combinatorics and Graph Theory

Fall 2022

This is the home page for COMPSCI 575 and MATH 513, a single course cross-listed in both computer science and mathematics. COMPSCI 575 has a section for undergraduates and a section for graduates, but requirements and grading are the same for all students in the course.
Here is a PDF of the course syllabus

Summary Description This course is a basic introduction to combinatorics and graph theory for advanced undergraduates in computer science, mathematics, engineering and science. Topics covered include: elements of graph theory; Euler and Hamiltonian circuits; graph coloring; matching; basic counting methods; generating functions; recurrences; inclusion-exclusion; and Polya's theory of counting.

When/Where: Tue/Thu 1:00-2:15pm, Morrill 2 222.
Instructor: Marius Minea (marius at cs), office: LGRC A261
Course material will be posted on Moodle and communication (announcements and Q&A) happens via Campuswire.
TA: Kyle Doney (kpdoney)
Graders: Pavan Datta Abbineni, Sai Veneer Vennam

Structure and grading The course will feature homework (usually biweekly), two midterms, and a final exam.

Textbook Miklós Bóna: Introduction to Enumerative and Analytic Combinatorics, 2nd edition, CRC Press, 2016, available in paper form and digital version via eCampus and elsewhere.

Topics (tentative, to be updated)

The course will largely follow the structure of recent offerings (Fall 2020, Fall 2018) taught by Prof. David Mix Barrington.
Last modified: Sun Sep 18 15:37:58 EDT 2022