Section 6.

2 – The Pigeonhole Principle

Section 6.3 – Permutations and Combinations

Section 6.4 – The Binomial Theorem
Section 6.5 – Generalised Permutations and Combinations
Section 8.2 - Solving Linear Recurrence Relations
Section 8.5 – Inclusion Exclusion

Section 8.6 – Applications of Inclusion Exclusion

Section 9.1 – Relations and Their Properties

Section 10.1 – Graphs and Graph Models

Section 10.2 – Graph Terminology and Types of Graphs
Section 10.3 – Graph Isomorphism

Adjacency List:

Adjacency Matrix:

Incidence Matrix:
Section 10.4 - Connectivity

Inequality for Vertex and Edge Connectivity:

Section 10.5 – Euler Paths and Hamilton Paths

Section 10.7 – Planar Graphs
Section 10.8 – Graph Coloring

Section 11.1 – Introduction to Trees