Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Combinatorial Methods in Discrete Mathematics
  • Cited by 39
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      March 2010
      January 1996
      ISBN:
      9780511666186
      9780521455138
      9780521172769
      DOI:
      https://doi.org/10.1017/CBO9780511666186
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.631kg, 324 Pages
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.45kg, 322 Pages
      • Subjects:
      Mathematics (general), Mathematics, Discrete Mathematics Information Theory and Coding
      Series:
      Encyclopedia of Mathematics and its Applications (55)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics (general), Mathematics, Discrete Mathematics Information Theory and Coding
    Series:
    Encyclopedia of Mathematics and its Applications (55)
    Information

    Book 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.

    Reviews

    Review of the hardback:‘ … a very enjoyable and brisk introduction to the exciting fields of enumerative and probabilistic combinatorics’.

    B. Bollobás Source: 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 Source: Bulletin of the Edinburgh Mathematical Society

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.