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 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.
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 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.
by William Chen - Macquarie University
Contents: Uniform Distribution; Classical Discrepancy Problem; Generalization of the Problem; Introduction to Lower Bounds; Introduction to Upper Bounds; Fourier Transform Techniques; Upper Bounds in the Classical Problem; Disc Segment Problem; etc.