Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Extremal Combinatorics - With Applications in Computer Science

Extremal Combinatorics

With Applications in Computer Science

Jukna, Stasys

2nd ed. 2011, XXIV, 412 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$69.99

(net) price for USA

ISBN 978-3-642-17364-6

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$89.95

(net) price for USA

ISBN 978-3-642-17363-9

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$89.95

(net) price for USA

ISBN 978-3-642-26990-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Provides a self-contained, up-to-date introduction to extremal combinatorics for nonspecialists
  • No special combinatorial or algebraic background is assumed,
  • Introduces all necessary elements of linear algebra and discrete probability
  • Expanded with substantial new material, and has been revised and updated throughout

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.

Content Level » Research

Keywords » Combinatorics - Discrete Probability - Error-Correcting Codes - Extremal Combinatorics - Extremal Set Theory - Linear Algebra - Linear Algebra Method - Polynomial Method - Probabilistic Method - Ramsey Theory

Related subjects » Computational Science & Engineering - Number Theory and Discrete Mathematics - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.