Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.Read more
- Never available before in English
- Interesting approach gives unified and simple approach
- Lots of results given explicitly, so useful as reference
Reviews & endorsements
Review of the hardback: ' … a very enjoyable and brisk introduction to the exciting fields of enumerative and probabilistic combinatorics'. B. Bollobás, Bulletin of the London Mathematical SocietySee more reviews
Review of the hardback: ' … for the serious student of generating functions and asymptotic techniques it provides an account of the work of Kolchin (who did the translation), the author and others which is not otherwise readily available in English.' I. Anderson, Bulletin of the Edinburgh Mathematical Society
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: June 2011
- format: Paperback
- isbn: 9780521172769
- length: 322 pages
- dimensions: 234 x 156 x 17 mm
- weight: 0.45kg
- availability: Available
Table of Contents
Preface to the English edition
1. Combinatorial configurations
2. Transversals and permanents
3. Generating functions
4. Graphs and mappings
5. The general combinatorial scheme
6. Polya's theorem and its applications
Sorry, this resource is locked
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×