MATH4707: Introduction to Combinatorics and Graph Theory

4 Credits

Existence, enumeration, construction, algorithms, optimization. Pigeonhole principle, bijective combinatorics, inclusion-exclusion, recursions, graph modeling, isomorphism. Degree sequences and edge counting. Connectivity, Eulerian graphs, trees, Euler's formula, network flows, matching theory. Mathematical induction as proof technique. prereq: 2243, [2283 or 3283]

View on University Catalog

All Instructors

B+ Average (3.202)Most Common: A (30%)

This total also includes data from semesters with unknown instructors.

388 students
SNWFDCBA
  • 5.03

    /6

    Recommend
  • 4.96

    /6

    Effort
  • 5.41

    /6

    Understanding
  • 5.05

    /6

    Interesting
  • 5.14

    /6

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request

      Not affiliated with the University of Minnesota

      Privacy Policy