MATH 61 - Discrete Mathematics

---

Table of contents

• 1 - Sets - 1.1, 3.1
• 10 - Pigeonhole Principle - 6.8
• 11 - Recurrence Relations - 7.1
• 12 - Recurrence Relations Cont. - 7.2
• 13 - Graphs - 8.1
• 14 - Paths and Cycles - 8.2, 8.3
• 15 - Shortest Path - 8.4
• 16 - Representations of Graphs - 8.5
• 17 - Isomorphisms of Graphs - 8.6
• 18 - Planar Graphs - 8.7
• 19 - Trees - 9.1,9.2
• 2 - Proofs - 2.2
• 20 - Spanning and Binary Trees - 9.3, 9.4, 9.5
• 21 - Isomorphism of Trees - 9.8
• 3 - Mathematical Induction - 2.4
• 4 - Sequences - 3.2
• 5 - Relations - 3.3
• 6 - Equivalence Relations & Matrices - 3.4,3.5
• 7 - Counting Principles - 6.1
• 8 - Permutations and Combinations - 6.2
• 9 - Gen. Perms. Combs. and Binomial Coefficients - 6.3,6.7
• Math 61 Midterm 1 Review