Details

Subject(s)

• Combinatorial analysis [Browse]
• Extremal problems (Mathematics) [Browse]

Series

Texts in theoretical computer science [More in this series]

Summary note

A concise and up-to-date introduction to extremal combinatorics for non-specialists, this text places a strong emphasis on theorems with particularly elegant and informative proofs which may be called the gems of the theory.

Bibliographic references

Includes bibliographical references (pages 393-405) and indexes.

Contents

• The Classics
• Counting
• Advanced Counting
• Probabilistic Counting
• The Pigeonhole Principle
• Systems of Distinct Representatives
• Extremal Set Theory
• Sunflowers
• Intersecting Families
• Chains and Antichains
• Blocking Sets and the Duality
• Density and Universality
• Witness Sets and Isolation
• Designs
• The Linear Algebra Method
• The Basic Method
• Orthogonality and Rank Arguments
• Eigenvalues and Graph Expansion
• The Polynomial Method
• Combinatories of Codes
• The Probabalistic Method
• Linearity of Expectation
• The Lovasz Sieve
• The Deletion Method
• The Second Moment Method
• The Entropy Function
• Random Walks
• Derandomization
• Fragments of Ramsey Theory
• Ramseyan Theorems for Numbers
• The Hales-Jewett Theorem
• Applications in Communication Complexity.

Show 29 more Contents items

ISBN

• 9783642173639 ((hard cover ; : acid-free paper))
• 3642173632 ((hard cover ; : acid-free paper))
• 9783642173646 ((ebook))
• 3642173640 ((ebook))

LCCN

2011937551

OCLC

755073401

Statement on language in description

Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...