Combinatorial Methods in Discrete Mathematics (Paperback)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Encyclopedia of Mathematics and its Applications
Release date:	June 2011
First published:	November 2010
Authors:	Vladimir N. Sachkov
Translators:	V. Kolchin
Dimensions:	234 x 156 x 17mm (L x W x T)
Format:	Paperback - Trade
Pages:	322
ISBN-13:	978-0-521-17276-9
Languages:	English
Subtitles:	Russian
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Promotions
LSN:	0-521-17276-4
Barcode:	9780521172769

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!