Foundations of Combinatorics with Applications
by Edward A. Bender, S. Gill Williamson
Publisher: Dover Publications 2006
Number of pages: 480
This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Some ability to construct proofs is assumed.
Home page url
Download or read it online for free here:
(multiple PDF files)
by Philippe Flajolet, Robert Sedgewick - Cambridge University Press
Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.
by S. E. Payne - University of Colorado
These notes deal with enumerative combinatorics. The author included some traditional material and some truly nontrivial material, albeit with a treatment that makes it accessible to the student. He derives a variety of techniques for counting.
by Richard P. Stanley - MIT
The standard guide to the topic for students and experts alike. The material in Volume 1 was chosen to cover those parts of enumerative combinatorics of greatest applicability and with the most important connections with other areas of mathematics.
by Peter J. Cameron - Queen Mary, University of London
Contents: Subsets and binomial coefficients; Selections and arrangements; Power series; Recurrence relations; Partitions and permutations; The Principle of Inclusion and Exclusion; Families of sets; Systems of distinct representatives; etc.