Item type Location Call Number Status Date Due
E-Book E-Book AUM Main Library 004.0151 (Browse Shelf) Not for loan

Preface -- Prolog: What this Book Is About -- Notation -- Counting -- Advanced Counting -- Probabilistic Counting -- The Pigeonhole Principle -- Systems of Distinct Representatives -- Sunflowers -- Intersecting Families -- Chains and Antichains -- Blocking Sets and the Duality -- Density and Universality -- Witness Sets and Isolation -- Designs -- The Basic Method -- Orthogonality and Rank Arguments -- Eigenvalues and Graph Expansion -- The Polynomial Method -- Combinatorics of Codes -- Linearity of Expectation -- The Lovász Sieve -- The Deletion Method -- The Second Moment Method -- The Entropy Function -- Random Walks -- Derandomization -- Ramseyan Theorems for Numbers -- The Hales–Jewett Theorem -- Applications in Communications Complexity -- References -- Index.

This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text. This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal—Katona theorem on shadows, the Lovász—Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi—Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.

There are no comments for this item.

Log in to your account to post a comment.