by Klaus Truemper
Publisher: Leibniz 1998
Number of pages: 398
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, making the main results easily understandable.
Home page url
Download or read it online for free here:
(multiple PS files)
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 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 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.
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.