by Gian-Carlo Rota
Number of pages: 414
In 1998, Gian-Carlo Rota gave his famous course, Combinatorial Theory, at MIT for the last time. John N. Guidi taped the lectures and took notes which he then wrote up in an almost verbatim manner conveying the substance and some of the atmosphere of the course. Topics covered included sets, relations, enumeration, order, matching, matroids, and geometric probability.
Home page url
Download or read it online for free here:
by Federico Ardila - arXiv
The main goal of this survey is to state clearly and concisely some of the most useful tools in algebraic and geometric enumeration, and to give many examples that quickly and concretely illustrate how to put these tools to use.
by Louis J. Billera, at al. - Cambridge University Press
The rich combinatorial problems arising from the study of various algebraic structures are the subject of the book. It will present the state of the art to graduate students and researchers in combinatorics as well as algebra, geometry, and topology.
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 Albert Nijenhuis, Herbert S. Wilf - Academic Press Inc
This 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.