Difference between revisions of "Combinatorics and Graph Theory"
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{Infobox | ||
| + | | title = Combinatorics and Graph Theory | ||
| + | | header1 = Mathematics Course | ||
| + | | label2 = Course Code | data2 = [[Combinatorics and Graph Theory|DMAT]] | ||
| + | | label3 = Year Opened | data3 = 2004 | ||
| + | | label4 = Sites Offered | data4 = [[SCZ]] | ||
| + | | label5 = Previously Offered | data5 = [[ASU]], [[BRI]], [[EST]] | ||
| + | }} | ||
{{CAA courses}} | {{CAA courses}} | ||
| − | |||
==Course Description== | ==Course Description== | ||
Latest revision as of 12:27, 20 November 2018
| Mathematics Course | |
|---|---|
| Course Code | DMAT |
| Year Opened | 2004 |
| Sites Offered | SCZ |
| Previously Offered | ASU, BRI, EST |
Course Description
During the CTY all-site meeting on opening day, what is the smallest number of students who need to enter the auditorium before there will be at least three students in the room who already knew each other before attending CTY, or at least three students who were all strangers before they arrived? This problem can be illustrated by a type of graph in which vertices representing students are connected by edges that are colored to indicate friendships. This course introduces students to such problems and how to approach them as they learn the mathematics of combinatorics.
This course begins with an exploration of enumerative combinatorics. Students use different techniques of mathematical proof and ideas in set theory to solve a variety of problems, and they study topics such as binomial coefficients, permutations, and partitions. For example, students employ bijective functions to turn seemingly tedious counting problems into much simpler problems, such as how to determine the number of games played in the March Madness tournament without needing to pull out your bracket and count one by one.
Students then investigate graph theory, an area of mathematics that is used in modern applications in fields such as computer science, counterterrorism, and navigation. One famous question in graph theory posed in the early 1800s—whether you can color any map using just four colors so that no two adjacent areas share the same color—took over 100 years for mathematicians to answer in the affirmative. Students explore this question and other historic problems in graph theory as they delve into concepts such as cycles, planarity, algorithms, and graph colorings.
Along the way, students encounter problems that are challenging and fun, and that can be solved with creativity and determination, even without a prior background in college-level math.
Note: A graphing calculator, such as a TI-83 Plus or TI-84, is required.
