Combinatorics Through Guided Discovery
by Kenneth P. Bogart
Publisher: Dartmouth College 2004
Number of pages: 202
This book 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.
Home page url
Download or read it online for free here:
by Richard P. Stanley - MIT
Contents: Walks in graphs; Cubes and the Radon transform; Random walks; The Sperner property; Group actions on boolean algebras; Young diagrams and q-binomial coefficients; Enumeration under group action; A glimpse of Young tableaux; etc.
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 Edward A. Bender, S. Gill Williamson - Dover Publications
This introduction to combinatorics, 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.
by Gian-Carlo Rota
In 1998, Gian-Carlo Rota gave his famous course at MIT. John N. Guidi took notes in a verbatim manner conveying the substance of the course. Topics covered included sets, relations, enumeration, order, matching, matroids, and geometric probability.