A Practical Guide to Working Through C L Liu Discrete Mathematics
Liu's Discrete Mathematics is one of those textbooks that sits on the shelf looking dignified and then absolutely destroys your confidence by chapter three. It's not mean-spirited. The material is just dense and the notation is compact. I spent two semesters working through it as an undergrad and later assigned it to students. Here's what you need to know before you start. The book walks through the standard undergraduate discrete math curriculum: set theory, relations and functions, combinatorics, graph theory, Boolean algebra, formal languages, and automata. The treatment is rigorous but not overwhelming — it expects you to read carefully and work problems. The chapter on graph theory is particularly strong, and the automata section gives you a solid foundation without diving into the heavy mathematical proofs you'd find in a theory-focused course. One thing people miss about the C L Liu Discrete Mathematics textbook is that the examples are intentionally compressed. Liu writes them as if he expects you to fill in the steps yourself. I've had students complain about this, and they're not wrong, but it's actually the book's greatest strength. When you're forced to reconstruct the intermediate steps, you learn more than if every detail were spelled out.
How to Approach the Problem Sets
The exercises are where this book earns its reputation. They range from routine drills to genuinely difficult proof problems. My approach was to attempt every odd-numbered problem before looking at anything else, and to write out full proofs even when the problem seems simple. The pattern in these exercises is that difficulty clusters around chapters 5 through 8. Graph theory proofs in particular will make you stare at a blank page for twenty minutes before you figure out where to start. Here's a specific problem type that trips people up repeatedly: counting problems involving inclusion-exclusion with overlapping constraints. Liu presents these cleanly in the combinatorics chapters, but the trick is recognizing when the standard formula doesn't directly apply. I encountered this myself when working through a problem that asked for the number of permutations of a multiset with restricted positions. The straightforward inclusion-exclusion approach gives a formula, but computing it efficiently requires noticing a symmetry in the constraint structure that isn't stated explicitly. The workaround is to draw the constraint matrix first and identify which terms in the inclusion-exclusion sum are actually zero. This cuts computation time significantly and avoids the common error of carrying forward terms that should cancel.
Common Pitfalls
Students tend to rush through the logic and set theory chapters because the material feels familiar from earlier exposure. This is a mistake. Liu builds everything on these foundations, and a weak grasp of quantifier manipulation or set identities will make the later chapters feel impossible. Spend extra time on chapters 1 through 3. Work through the proof techniques carefully, especially induction and contradiction. Another issue: the book uses a notation style that blends mathematical and computer science conventions. If you're coming from a pure math background, some of the notation in the automata and formal languages sections will look unusual. If you're coming from computer science, the level of formality in the earlier chapters might feel excessive. Neither orientation is wrong, but awareness of the gap helps you adjust your reading strategy.
Get the Full Details
Where the Book Falls Short
Liu's treatment of computational complexity is thin. If you're looking for a deeper discussion of P versus NP or reducibility, you'll need a supplement. The book mentions these concepts but doesn't develop them rigorously. Also, there are relatively few applied examples compared to Rosen's Discrete Mathematics. If you learn better from real-world applications — cryptography, network routing, scheduling problems — you may find Liu too abstract at times. For those cases, I'd pair Liu with Rosen as a reference or use Klivans and DiPasquale's notes alongside it for the complexity material. Liu remains the stronger choice for building proof-writing discipline, but no single textbook covers everything adequately.
How to Use This Book Effectively
Read each section twice. The first pass gives you the general idea. The second pass, with a pen in hand, is where you actually learn the material. Work problems in small batches — three or four at a time — and check your answers before moving on. The back of the book has answers to selected problems, but the even-numbered ones are not always available, which is frustrating but forces you to verify your work through peer discussion or office hours. If you're self-studying, commit to doing at least eighty percent of the exercises. The book rewards effort proportionally. Skipping problems is the fastest way to finish the book without actually learning discrete mathematics. Download options vary by region and edition. The second edition is widely available through academic publishers and used book markets. Be aware that there are differences between editions, particularly in the graph theory and automata chapters, so check the table of contents against your course syllabus before purchasing.
