Extremal Combinatorics With Applications in Computer Science by Stasys Jukna
  • InstantOn purchase
  • Full bookAll chapters
  • Any devicePC, tablet, phone
  • SecureSSL checkout
Authorised digital seller
On saleDigital download

Extremal Combinatorics With Applications in Computer Science by Stasys Jukna

by Springer Berlin Heidelberg

Rated 4.9 by 12,400+ readers
$62.01 $109.00 Save 43%

Lowest price online, guaranteed. One-time payment, no subscription.

Publisher store $109.00
BooksGen $62.01

Download link emailed instantly after payment, 24/7

AMERICAN EXPRESSAPPLE PAYDINERS CLUBDISCOVERGOOGLE PAYKLARNA
30-day money-back guarantee

File issue? We replace it or refund you, no questions asked.

Digital product, nothing is shipped

You'll receive a download link by email immediately after checkout.

Can't find the ebook you need?

Send us the book cover via live chat and we'll request it for you. Typical response time: 10 minutes.

About this book

What's inside

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.

How it works

From checkout to chapter one in seconds

0110 sec

Check out securely

Pay by card or wallet. Use an email address you can access right now.

02Instant

Get your link

Your download link arrives by email the moment your payment clears, 24/7.

03Forever

Read anywhere

Open it on your laptop, tablet or phone. Save it and keep it.

Why buy from us

Smarter than paying full price

100%

Authorised by publisher: licensed copy, never pirated.

–84%

Less than Amazon Kindle, with our lowest-price guarantee.

Instant

Delivered the moment your payment clears, day or night.

Full

Complete edition: every chapter, no missing pages.

Questions

Good to know

How do I receive my ebook?

Right after checkout we email you a download link. Check your spam folder if it doesn't arrive within a few minutes.

Which devices can I read it on?

Any computer, tablet or phone. PDF opens in any browser or free reader app.

I entered the wrong email. What now?

Contact us via live chat with your order number and we'll resend the link to the right address.

What if there's a problem with the file?

We'll replace it or refund you within 30 days, no questions asked.