Extremal Combinatorics

With Applications in Computer Science

By:

Stasys Jukna

Format:

Hardback

Series:

Texts in Theoretical Computer Science: An EATCS Series

Show Hide Adult Content

$244.99

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

4 payments of $61.25 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

Around 26 Jun - 8 Jul using International Courier

Description

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.

Author Biography:

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.

Release date Australia

September 2nd, 2011

Author

Stasys Jukna

Audience

Professional & Vocational

Edition

2nd ed. 2011

Illustrations

XXIV, 412 p.

Pages

412

Series

Texts in Theoretical Computer Science: An EATCS Series

Dimensions

156x234x23

ISBN-13

9783642173639

Product ID

10405656

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Get free delivery, exclusive deals, and more^*

Non-Fiction Books:

Extremal Combinatorics

By:

Format:

Series:

Buy Now, Pay Later with:

Availability

Description

Author Biography:

Customer reviews

Marketplace listings

Help & options

Filed under...

Get free delivery, exclusive deals, and more*

Buy Now, Pay Later with:

Author Biography:

Get free delivery, exclusive deals, and more^*