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.198)Most Common: A (31%)

This total also includes data from semesters with unknown instructors.

361 students
SNWFDCBA

  • 4.00

    /5

    Recommend

  • 4.21

    /5

    Effort

  • 4.39

    /5

    Understanding

  • 4.00

    /5

    Interesting

  • 4.38

    /5

    Activities
      Contribute on our Github

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

      Privacy Policy