Extremal Combinatorics | With Applications in Computer Science

Stasys Jukna

ISBN 10: 3642173632 / ISBN 13: 9783642173639

Published by Springer-Verlag GmbH, 2011

About this Item

Extremal Combinatorics | With Applications in Computer Science | Stasys Jukna | Buch | xxiv | Englisch | 2011 | Springer-Verlag GmbH | EAN 9783642173639 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Seller Inventory # 107152232

Bibliographic Details

• Title: Extremal Combinatorics | With Applications in Computer Science
• Publisher: Springer-Verlag GmbH
• Publication Date: 2011
• Language: English
• ISBN 10: 3642173632
• ISBN 13: 9783642173639
• Binding: Buch
• Edition: 2nd Edition
• Condition: Neu
• Dimensions: 241W x 160H x 29D millimeters 241 millimeters width by 160 millimeters height by 29 millimeters depth
• Weight: 816 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.

About the Author

The author is a professor at the Goethe Universität Frankfurt and he is also a member of the Vilnius University Institute of Mathematics and Informatics. His main fields of research are theoretical computer science and discrete mathematics, in particular complexity.