Skip to content
Register Sign in Wishlist
Combinatorial Methods in Discrete Mathematics

Combinatorial Methods in Discrete Mathematics

$201.00 (C)

Part of Encyclopedia of Mathematics and its Applications

  • Date Published: January 1996
  • availability: Available
  • format: Hardback
  • isbn: 9780521455138

$ 201.00 (C)

Add to cart Add to wishlist

Other available formats:
Paperback, eBook

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

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

    • 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

    "...a clear introduction to enumerative combinatorics, with considerable material on asymptotic formulae and some applications." R.J. Bumcrot, Mathematical 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: January 1996
    • format: Hardback
    • isbn: 9780521455138
    • length: 324 pages
    • dimensions: 229 x 152 x 22 mm
    • weight: 0.65kg
    • availability: Available
  • Table of Contents

    Preface to the English edition
    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

  • Author

    Vladimir N. Sachkov


    V. Kolchin

Sign In

Please sign in to access your account


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

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 Please see the permission section of the 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.


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.