DeepRead
Cover of Extremal combinatorics

Extremal combinatorics

Stasys Jukna · 2011

Mathematics and physics › Numerical and matrix computation

#15,370 most recommended

About the book

A graduate-level textbook on extremal combinatorics, which asks how large or small a finite structure can be while avoiding a given property, such as how many edges a graph can have without containing a certain subgraph. It covers classical results in extremal set theory, graph theory, and Ramsey theory, along with the main proof techniques used for them. The book is aimed at students and researchers in mathematics and theoretical computer science. The book presents extremal combinatorics as a unified toolkit rather than a collection of isolated theorems, so that methods such as double counting, linear algebra, the probabilistic method, and shifting or compression arguments can be seen recurring across many problems. It emphasises applications of these bounds in computer science, including circuit complexity, communication complexity, and lower bounds for algorithms. Its main claim is pedagogical: that mastering a small set of general techniques lets a reader attack new extremal questions, and that these techniques connect pure combinatorics to problems in computing.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

00.51201420162018202020212014 peak · 1
This bookAverage book in Numerical and matrix computation

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 2 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2011
Editions known
4 at Open Library
Open Library
OL16368608W

Combinatorial analysisExtremal problems (Mathematics)

Explore in the mosaic

Read next: its neighbours on the mosaic