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, ...
Read More
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 Less
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $65.71, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2011 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Trade paperback (US). Contains: Unspecified. Encyclopedia of Mathematics and its Applications . Includes unspecified. Intended for professional and scholarly audience.
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $72.57, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2011 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Contains: Unspecified. Encyclopedia of Mathematics and its Applications . Includes unspecified. Intended for professional and scholarly audience.
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $79.80, new condition, Sold by Just one more Chapter rated 3.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 2011 by Cambridge University Press.
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $102.64, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 1996 by Cambridge University Press.
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $137.80, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1996 by Cambridge University Press.
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $163.76, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 1996 by Cambridge University Press.
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $173.20, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1996 by Cambridge University Press.
Add this copy of Combinatorial Methods in Discrete Mathematics to cart. $176.81, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 1996 by Cambridge University Press CUP.
