Principles of counting, subsets and designs, partition and distribution, and modular arithmetic. Algorithms & Graphs:
Descriptions of algorithms were revised to closely resemble real programming languages, making them more accessible for computer science students. Principles of counting, subsets and designs, partition and
The 2002 edition is divided into logical clusters that build upon one another: 1. Foundations Definitions, subsets, and power sets. Foundations Definitions, subsets, and power sets
| Book | Strengths vs. Biggs (2002) | Weaknesses vs. Biggs | | :--- | :--- | :--- | | | More examples, more colorful, encyclopedic. | Can feel bloated; less mathematical maturity demanded. | | Epp (4th ed.) | Excellent for CS students; strong on logic and proofs. | Weaker on graph theory and algebraic topics. | | Grimaldi | Great for combinatorics and number theory. | Dense typesetting; less modern in algorithm coverage. | | Biggs (2002) | Perfect balance of theory and application; superb graph theory. | Fewer color figures; may be too concise for absolute beginners. | Biggs | | :--- | :--- | :---