Select the desired Level or Schedule Type to find available classes for the course. |

MATH 360 - Combinatorics and Graph Theory |

An introduction to the basic techniques and reasoning of combinatorial problem-solving. Topics from graph theory studied include the types of graphs, planarity, coloring theorems, and an introduction to Ramsey theory. Topics from enumerative combinatorics studied include counting principles, inclusion/exclusion, the pigeonhole principle, combinations, permutations, binomial identities, and generating functions.
Prerequisites: Completion of MATH 206 Discrete Mathematics I with a minimum grade of C (2.00) and MATH 220 Calculus II or permission of instructor.
1.000 Credit hours 4.000 Lecture hours Levels: Non-Matriculated, Undergraduate Schedule Types: Directed Study, Independent/Directed Study, Lecture Mathematics Department Course Attributes: Undergraduate Level Course Restrictions: May not be enrolled in one of the following Levels: Non-Matriculated May not be assigned one of the following Student Attributes: DGCE Student Prerequisites: PREREQ for MATH 360 General Requirements: ( May not be taken concurrently. ) or ( May not be taken concurrently. ) or ( Course or Test: MATH 206 Minimum Grade of C May not be taken concurrently. and Course or Test: MATH 220 May not be taken concurrently. ) or ( Course or Test: MATH 206 Minimum Grade of P May not be taken concurrently. and Course or Test: MATH 220 May not be taken concurrently. ) |

Return to Previous | New Search |