by Albert Nijenhuis, Herbert S. Wilf
Publisher: Academic Press Inc 1978
Number of pages: 316
The book is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.
Home page url
Download or read it online for free here:
by Mitchel T. Keller, William T. Trotter - Georgia Institute of Technology
The purpose of the course is to give students a broad exposure to combinatorial mathematics, using applications to emphasize fundamental concepts and techniques. Our approach to the course is to show students the beauty of combinatorics.
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 David Guichard - Whitman College
The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.
by Klaus Truemper - Leibniz
Matroids were introduced in 1935 as an abstract generalization of graphs and matrices. Matroid decomposition covers the area of the theory dealing with decomposition and composition of matroids. The exposition is clear and simple.