Description:
Recurrence and generating functions, Ramsey theory. Block designs, Latin squares, Eulerian and Hamiltonian paths. Minimum spanning trees, network flows.
Description:
Recurrence and generating functions, Ramsey theory. Block designs, Latin squares, Eulerian and Hamiltonian paths. Minimum spanning trees, network flows.
Semester:
Spring of every year
Credits:
Total Credits: 3 Lecture/Recitation/Discussion Hours: 3
Recommended Background:
MTH 310
Description:
Recurrence and generating functions, Ramsey theory. Block designs, Latin squares, Eulerian and Hamiltonian paths. Minimum spanning trees, network flows.
Semester:
Spring of every year
Credits:
Total Credits: 3 Lecture/Recitation/Discussion Hours: 3
Recommended Background:
MTH 310
Description:
Recurrence and generating functions, Ramsey theory. Block designs, Latin squares, Eulerian and Hamiltonian paths. Minimum spanning trees, network flows.