Skip to main content

Combinatorics And Graph Theory

Instructor:
Richard Ehrenborg, Professor
415G
Credits:
3.0
001
Building:
Chemistry-Physics Bldg
Room:
Rm.211
Semester:
Fall 2024
Start Date:
End Date:
Name:
Combinatorics And Graph Theory
Requisites:

Prereq: MA 213 or MA 322

Class Type:
LEC
1:00 pm
1:50 pm
Days:
MWF

A basic course in the theory of counting and graph theory. Topics in enumerative combinatorics may include: generating functions, compositions, partitions, Fibonacci numbers, permutations, cycle structure of permutations, permutations statistics, Stirling numbers of the first and second kind, Bell numbers, or inclusion-exclusion. Topics in graph theory may include: Eulerian and Hamiltonian cycles, matrix tree theorem, planar graphs and the 4-color theorem, chromatic polynomial, Hall's marriage theorem, stable marriage theorem, Ramsey theory, or electrical networks.

A basic course in the theory of counting and graph theory. Topics in enumerative combinatorics may include: generating functions, compositions, partitions, Fibonacci numbers, permutations, cycle structure of permutations, permutations statistics, Stirling numbers of the first and second kind, Bell numbers, or inclusion-exclusion. Topics in graph theory may include: Eulerian and Hamiltonian cycles, matrix tree theorem, planar graphs and the 4-color theorem, chromatic polynomial, Hall's marriage theorem, stable marriage theorem, Ramsey theory, or electrical networks.

CS