Skip to main content

Extremal Combinatorics

With Applications in Computer Science

  • Textbook
  • © 2011
  • Latest edition


  • A concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists
  • No special combinatorial or algebraic background is assumed, all necessary elements of linear algebra and discrete probability are introduced
  • The second edition has been extended with substantial new material, and has been revised and updated throughout
  • Includes supplementary material:

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others


Table of contents (27 chapters)

  1. The Classics

  2. Extremal Set Theory

  3. The Linear Algebra Method


From the reviews of the second edition:

“This is an entertaining and impressive book. I say impressive because the author managed to cover a very large part of combinatorics in 27 short chapters, without assuming any graduate-level knowledge of the material. … The collection of topics covered is another big advantage of the book. … The book is ideal as reference material or for a reading course for a dedicated graduate student. One could teach a very enjoyable class from it as well … .” (Miklós Bóna, The Mathematical Association of America, May, 2012)

"[R]eaders interested in any branch of combinatorics will find this book compelling. ... This book is very suitable for advanced undergraduate and graduate mathematics and computer science majors. It requires a very solid grounding in intermediate-level combinatorics and an appreciation for several proof methods, but it is well worth the study." (G.M. White, ACM Computing Reviews, May 2012)

“This is the second edition of a well-received textbook. It has been extended with new and updated results. Typographical errors in the first edition are corrected. … This textbook is suitable for advanced undergraduate or graduate students as well as researchers working in discrete mathematics or theoretical computer science. The author’s enthusiasm for the subject is evident and his writing is clear and smooth. This is a book deserving recommendation.” (Ko-Wei Lih, Zentralblatt MATH, Vol. 1239, 2012)

“This is an introductory book that deals with the subject of extremal combinatorics. … The book is nicely written and the author has included many elegant and beautiful proofs. The book contains many interesting exercises that will stimulate the motivated reader to get a better understanding of this area. … author’s goal of writing a self-contained book that is more or less up to date … and that is accessible to graduate and motivated undergraduate students inmathematics and computer science, has been successfully achieved.” (Sebastian M. Cioabă, Mathematical Reviews, January, 2013)

Authors and Affiliations

  • Institut für Informatik, Goethe Universität Frankfurt, Frankfurt am Main, Germany

    Stasys Jukna

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.

Bibliographic Information

Publish with us