Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability / Edition 1

Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability / Edition 1

by Béla Bollobás
ISBN-10:
0521337038
ISBN-13:
9780521337038
Pub. Date:
07/31/1986
Publisher:
Cambridge University Press
ISBN-10:
0521337038
ISBN-13:
9780521337038
Pub. Date:
07/31/1986
Publisher:
Cambridge University Press
Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability / Edition 1

Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability / Edition 1

by Béla Bollobás

Paperback

$74.99 Current price is , Original price is $74.99. You
$74.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

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.

Product Details

ISBN-13: 9780521337038
Publisher: Cambridge University Press
Publication date: 07/31/1986
Edition description: New Edition
Pages: 192
Sales rank: 894,966
Product dimensions: 6.22(w) x 9.09(h) x 0.55(d)

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.
From the B&N Reads Blog

Customer Reviews