MATH 3373
Combinatorics and Graph Theory
Winter 2026
Topics
- Math 3373 is an introductory course on combinatorics and graph theory. As per the calendar de
- scription, we
- combinatorics and graph theory
- Prerequisites & Restrictions
- Prerequisites: Math 1271 or permission of the Chair of the department
- Learn how to read mathematics independently, critically, and reflectively, and become familiar
- with the form of general mathematical exposition
- Understand the terms Theorem, Lemma, Proposition, Definition, Proof, Remark, Conjec
- ture, Corollary, and Example, together with their importance and significance in mathe
- matics
- Generate simple examples from definitions
- Formulate basic conjectures about number and graph sequences and patterns
- Graph Theory, and be able to identify which techniques are most useful for a given problem
- Counting principles: addition, subtraction, multiplication, and division principles
- Venn
- diagrams, Principle of Inclusion-Exclusion
- Counting Combinations and Permutations
- Pascal’s Triangle and the Binomial Theorem
- Proof techniques in Combinatorics: induction, counting in two ways, proof by contradic
- tion, and the Pigeon-Hole Principle
- Recurrence relations and generating functions
Readings
- There will be pre-class readings assigned from the following textbook:
Winter 2024
Topics
- 11 of the text Counting Rocks!
Winter 2017
Topics
- Date Contents Important Dates
Readings
- Robin J. Wilson, Introduction to Graph Theory (5th Edition), Prentice Hall, 2010.
Sources
- Course catalogue ↗2026–2027
- syllabus ↗Winter 2026
- Course source ↗
- syllabus ↗Winter 2024
- Course source ↗
- syllabus ↗Winter 2017
- Course source ↗