This introduction to combinatorics is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Covers basic counting, functions, decision trees, and sieving methods; fundamental concepts in graph theory and a sampler of graph topics; induction and recursion, sorting theory, and rooted plane trees. Numerous exercises (some with solutions), notes, and references. Includes 75 figures. Appendixes. Revised version of the Redwood City, California, 1991 edition.
Combinatorics for Computer Science by S. Gill Williamson Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with each part divided into a "basic concepts" chapter, followed by 4 "topics" chapters that explore ideas in depth. Includes 219 figures.
A Short Course in Discrete Mathematics by Edward A. Bender, S. Gill Williamson Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition.
Lattice Theory: First Concepts and Distributive Lattices by George Grätzer This outstanding text is written in clear language and enhanced with many exercises, diagrams, and proofs. It discusses historical developments and future directions and provides an extensive bibliography and references. 1971 edition.
