MATH5707
MATH 5707 - Graph Theory and Non-enumerative Combinatorics (4 Cr.)
School of Mathematics (11133)
TIOT - College of Science and Engineering
MATH 5707 - Graph Theory and Non-enumerative Combinatorics (4 Cr.)
Course description
Basic topics in graph theory: connectedness, Eulerian/Hamiltonian properties, trees, colorings, planar graphs, matchings, flows in networks. Optional topics include graph algorithms, Latin squares, block designs, Ramsey theory.
prereq: [2243 or 2373 or 2573], [2263 or 2374 or 2574]; [2283 or 3283 or experience in writing proofs] highly recommended; Credit will not be granted if credit has been received for: 4707
prereq: [2243 or 2373 or 2573], [2263 or 2374 or 2574]; [2283 or 3283 or experience in writing proofs] highly recommended; Credit will not be granted if credit has been received for: 4707
Minimum credits
4
Maximum credits
4
Is this course repeatable?
No
Grading basis
OPT - Student Option
Lecture
Requirements
001186
Fulfills the writing intensive requirement?
No
Typically offered term(s)
Every Fall & Spring