Combinatorial methods in discrete mathematics
by Sachkov, Vladimir Nikolaevich
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 transvers…
Read More ↓Title Statements
- Full title :Combinatorial methods in discrete mathematics / Vladimir N. Sachkov.
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.
Read More ↓Edition Statements
- Publication Date:1996.
Publication Statements
- Publisher(s):Cambridge University Press
- Place of Publication:Cambridge
- Language:eng
- Publication Date:1996.
The Physical Object
- Description:xiii, 306 pages : : illustrations ; : 24 cm
Edition Identifiers
- ISBN:0521455138, 9780521455138
- oclc:ocm30972028
- LC Classification:QA164
- Dewey Decimal:511/.6
Table of Contents
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.
Read More ↓Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Combinatorics
Integer Programming and Combinatorial Optimization
Combinatorial games
Files & Downloads
-
Combinatorial methods in discrete mathematics -- …
DJVU · 2.2 MB · updated -
Combinatorial Methods in Discrete Mathematics -- …
PDF · 2.0 MB · updated -
Combinatorial methods in discrete mathematics -- …
DJVU · 1.6 MB · updated
Rate & Review