Skip to content
Register Sign in Wishlist

Combinatorial Methods in Discrete Mathematics

Part of Encyclopedia of Mathematics and its Applications

  • Date Published: June 2011
  • availability: Available
  • format: Paperback
  • isbn: 9780521172769

Paperback

Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact asiamktg@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Never available before in English
    • Interesting approach gives unified and simple approach
    • Lots of results given explicitly, so useful as reference
    Read more

    Reviews & endorsements

    Review of the hardback: ' … a very enjoyable and brisk introduction to the exciting fields of enumerative and probabilistic combinatorics'. B. Bollobás, Bulletin of the London Mathematical Society

    Review of the hardback: ' … for the serious student of generating functions and asymptotic techniques it provides an account of the work of Kolchin (who did the translation), the author and others which is not otherwise readily available in English.' I. Anderson, Bulletin of the Edinburgh Mathematical Society

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: June 2011
    • format: Paperback
    • isbn: 9780521172769
    • length: 322 pages
    • dimensions: 234 x 156 x 17 mm
    • weight: 0.45kg
    • availability: Available
  • 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.

  • Author

    Vladimir N. Sachkov

    Translator

    V. Kolchin

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×