by Percy A. MacMahon
Publisher: Cambridge University Press 1915
Number of pages: 612
The object of this work is, in the main, to present to mathematicians an account of theorems in combinatory analysis which are of a perfectly general character, and to shew the connexion between them by as far as possible bringing them together as parts of a general doctrine. It may appeal also to others whose reading has not been very extensive.
Home page url
Download or read it online for free here:
Download link 1
Download link 2
by Dainis Zeps - Latvian University
Contents: Permutations; Combinatorial maps; The correspondence between combinatorial maps and graphs on surfaces; Map's mirror reflection and dual map; Multiplication of combinatorial maps; Normalized combinatorial maps; Geometrical interpretation...
by Kenneth P. Bogart - Dartmouth College
This is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'. The book consists almost entirely of problems.
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 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.