Skip to content
Register Sign in Wishlist
Combinatorics

Combinatorics
Topics, Techniques, Algorithms

£51.99

textbook
  • Date Published: October 1994
  • availability: Available
  • format: Paperback
  • isbn: 9780521457613

£ 51.99
Paperback

Add to cart Add to wishlist

Request inspection copy

Lecturers may request a copy of this title for inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a constructive or algorithmic proof is more valuable than an existence proof. The book is divided into two parts, the second at a higher level and with a wider range than the first. Historical notes are included which give a wider perspective on the subject. More advanced topics are given as projects and there are a number of exercises, some with solutions given.

    • Written in two parts at different levels
    • Includes projects for brighter students
    • Features historical notes which add perspective
    • Incorporates numerous exercises
    Read more

    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: October 1994
    • format: Paperback
    • isbn: 9780521457613
    • length: 368 pages
    • dimensions: 234 x 191 x 25 mm
    • weight: 0.61kg
    • availability: Available
  • Table of Contents

    Preface
    1. What is combinatorics?
    2. On numbers and counting
    3. Subsets, partitions, permutations
    4. Recurrence relations and generating functions
    5. The principle of inclusion and exclusion
    6. Latin squares and SDRs
    7. Extremal set theory
    8. Steiner triple theory
    9. Finite geometry
    10. Ramsey's theorem
    11. Graphs
    12. Posets, lattices and matroids
    13. More on partitions and permutations
    14. Automorphism groups and permutation groups
    15. Enumeration under group action
    16. Designs
    17. Error-correcting codes
    18. Graph colourings
    19. The infinite
    20. Where to from here?
    Answers to selected exercises
    Bibliography
    Index.

  • Resources for

    Combinatorics

    Peter J. Cameron

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact lecturers@cambridge.org.

  • Author

    Peter J. Cameron

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