Combinatorial Methods in Discrete Mathematics: (Encyclopedia of Mathematics and its Applications)
By
Vladimir N. Sachkov (Author) V. Kolchin (Contributor)
Hardback
Available / dispatched within 1 - 2 weeks
Quantity
Description
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.
More Details
- Contributor: Vladimir N. Sachkov
- Imprint: Cambridge University Press
- ISBN13: 9780521455138
- Number of Pages: 324
- Packaged Dimensions: 152x229x22mm
- Packaged Weight: 650
- Format: Hardback
- Publisher: Cambridge University Press
- Release Date: 1996-01-11
- Series: Encyclopedia of Mathematics and its Applications
- Binding: Hardback
Delivery Options
Home Delivery
Store Delivery
Free Returns
We hope you are delighted with everything you buy from us. However, if you are not, we will refund or replace your order up to 30 days after purchase. Terms and exclusions apply; find out more from our Returns and Refunds Policy.