- Schedule of Classes - June 2, 2019 7:14PM EDT
- Course Catalog - June 2, 2019 7:15PM EDT
Course information provided by the Courses of Study 2018-2019.
Combinatorics is the study of discrete structures that arise in a variety of areas, particularly in other areas of mathematics, computer science, and many areas of application. Central concerns are often to count objects having a particular property (e.g., trees) or to prove that certain structures exist (e.g., matchings of all vertices in a graph). The first semester of this sequence covers basic questions in graph theory, including extremal graph theory (how large must a graph be before one is guaranteed to have a certain subgraph) and Ramsey theory (which shows that large objects are forced to have structure). Variations on matching theory are discussed, including theorems of Dilworth, Hall, König, and Birkhoff, and an introduction to network flow theory. Methods of enumeration (inclusion/exclusion, Möbius inversion, and generating functions) are introduced and applied to the problems of counting permutations, partitions, and triangulations.
When Offered Spring.
Prerequisites/Corequisites Prerequisite: MATH 2210, MATH 2230, MATH 2310, or MATH 2940. Students will be expected to be comfortable with proofs.
Distribution Category (MQR-AS)
Regular Academic Session.
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
Class Number & Section Details
- TR Malott Hall 406
Disabled for this roster.