Combinatorial Methods in Discrete Mathematics

by Vladimir N. Sachkov, V. Kolchin

Overview

Discrete mathematics is an important tool for the investigation of various models of functioning of technical devices, especially in the field of cybernetics. Here the author presents some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. Professor Sachkov's aim is to focus attention on results 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, considered in Chapter 4. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book for graduate students and professionals that describes many ideas not previously available in English; the author has updated the text and references where appropriate.

Product Details

ISBN-13:	9780521172769
Publisher:	Cambridge University Press
Publication date:	06/02/2011
Series:	Encyclopedia of Mathematics and its Applications , #55
Edition description:	Reissue
Pages:	322
Product dimensions:	6.14(w) x 9.21(h) x 0.67(d)

Table of Contents

Preface; Preface to the English edition; Introduction; 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; Bibliography; Index.

Editorial Reviews

"...a clear introduction to enumerative combinatorics, with considerable material on asymptotic formulae and some applications." R.J. Bumcrot, Mathematical Reviews

From the Publisher