MATH 154Discrete Mathematics and Graph Theory
Basic concepts in graph theory, including trees, walks, paths, and connectivity, cycles, matching theory, vertex and edge-coloring, planar graphs, flows and combinatorial algorithms, covering Hall’s theorems, the max-flow min-cut theorem, Euler’s formula, and the travelling salesman problem. Credit not offered for MATH 154 if MATH 158 is previously taken. If MATH 154 and MATH 158 are concurrently taken, credit is only offered for MATH 158.
Prerequisites
From the catalog: “MATH 31CH or MATH 109. Students who have not completed listed prerequisites may enroll with consent of instructor.”
Where it sits in degree plans
One of the options in (3)
- Artificial Intelligence
- Computer Science (B.S.)
- Mathematics (Applied) (B.S.)
Courses that list MATH 154 as a prerequisite (9)
- CSE 100 Advanced Data Structures
- CSE 100R Advanced Data Structures
- CSE 101 Design and Analysis of Algorithms
- CSE 103 A Practical Introduction to Probability and Statistics
- CSE 105 Theory of Computability
- CSE 106 Discrete and Continuous Optimization
- CSE 107 Introduction to Modern Cryptography
- CSE 127 Introduction to Computer Security (4) Tags: Systems, Applications of Computing
- ECON 149 Introduction to Economic Design