Combinatorial methods in discrete mathematics /
This is an attempt to present 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 those that illustrate the methods descri...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English Russian |
| Published: |
Cambridge ; New York, NY, USA :
Cambridge University Press,
1996
|
| Series: | Encyclopedia of mathematics and its applications ;
volume 55 |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This is an attempt to present 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 those 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 4. The general combinatorial scheme is then introduced and, in the final 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 opportunity to update the text and references where appropriate |
|---|---|
| Physical Description: | 1 online resource (xiii, 306 pages) : illustrations |
| Bibliography: | Includes bibliographical references (pages 295-302) and index |
| ISBN: | 1107088682 9781107088689 |