Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Combinatorics

Combinatorics
Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability

$66.99 (X)

textbook
  • Date Published: August 1986
  • availability: Available
  • format: Paperback
  • isbn: 9780521337038

$ 66.99 (X)
Paperback

Add to cart Add to wishlist

Request examination copy

Instructors may request a copy of this title for examination

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Combinatorics is a book whose main theme is the study of subsets of a finite set. It gives a thorough grounding in the theories of set systems and hypergraphs, while providing an introduction to matroids, designs, combinatorial probability and Ramsey theory for infinite sets. The gems of the theory are emphasized: beautiful results with elegant proofs. The book developed from a course at Louisiana State University and combines a careful presentation with the informal style of those lectures. It should be an ideal text for senior undergraduates and beginning graduates.

    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: August 1986
    • format: Paperback
    • isbn: 9780521337038
    • length: 192 pages
    • dimensions: 231 x 158 x 14 mm
    • weight: 0.29kg
    • availability: Available
  • Table of Contents

    Frontispiece
    Preface
    1. Notation
    2. Representing sets
    3. Sperner systems
    4. The Littlewood - Offord problem
    5. Shadows
    6. Random sets
    7. Intersecting hypergraphs
    8. The Turán problem
    9. Saturated hypergraphs
    10. Well-separated systems
    11. Helly families
    12. Hypergraphs with a given number of disjoint edges
    13. Intersecting families
    14. Factorizing complete hypergraphs
    15. Weakly saturated hypergraphs
    16. Isoperimetric problems
    17. The trace of a set system
    18. Partitioning sets of vectors
    19. The four functions theorem
    20. Infinite ramsey theory
    References
    Index.

  • Editor

    Béla Bollobás

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

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