MATH5707: Graph Theory and Non-enumerative Combinatorics

4 Credits

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

View on University Catalog

All Instructors

A- Average (3.516)Most Common: A (41%)

This total also includes data from semesters with unknown instructors.

192 students
SNWFDCBA
  • 3.99

    /5

    Recommend
  • 4.74

    /5

    Effort
  • 4.39

    /5

    Understanding
  • 4.07

    /5

    Interesting
  • 4.68

    /5

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Spring 2024 provided by the Office of Institutional Data and Research

      Privacy Policy