by Mitchel T. Keller, William T. Trotter
Publisher: Georgia Institute of Technology 2013
Number of pages: 345
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 and how combinatorial problems naturally arise in many settings, particularly in computer science.
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 Linfan Mao - InfoQuest
Topics covered in this book include fundamental of mathematical combinatorics, differential Smarandache n-manifolds, combinatorial or differentiable manifolds and submanifolds, Lie multi-groups, combinatorial principal fiber bundles, 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 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.