Readership: Students and lecturers in mathematics and computer science
Norman L. Biggs, Professor of Mathematics, London School of Economics, University of London
"This is a new edition of a successful textbook ... this revision is particularly welcome ... The text is written in a fluent but rigorous style and should appeal to sixthformers and undergraduates who are alienated by more formal presentations. There are plenty of approachable exercises, ranging from easy riders to establish technique to more challenging problems which introduce new ideas, and a bonus is that all the answers are available on a companion web-site. I can thoroughly recommend this text." - The Mathematical Gazette
"A well known definition says that a textbook is a book such that everybody thinks he can write a better one. Biggs' Discrete Mathematics is an exception - not only for its wide range of topics and its clear organization but notably for its excellent style of explanation." - EMS
"... the ideal choice for introductory courses to discrete mathematicians." - Zentralblatt MATH
The Language of Mathematics 1: Statements and proofs 2: Set notation 3: The logical framework 4: Natural numbers 5: Functions 6: How to count 7: Integers 8: Divisibility and prime numbers 9: Fractions and real numbers Techniques 10: Principles of counting 11: Subsets and designs 12: Partition, classification and distribution 13: Modular arithmetic Algorithms and Graphs 14: Algorithms and their efficiency 15: Graphs 16: Trees, sorting and searching 17: Bipartite graphs and matching problems 18: Digraphs, networks and flows 19: Recursive techniques Algebraic Methods 20: Groups 21: Groups of permutations 22: Rings, fields and polynomials 23: Finite fields and some applications 24: Error-correcting codes 25: Generating functions 26: Partitions of a positive integer 27: Symmetry and counting
