Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
| Author | : | |
| Rating | : | 4.34 (865 Votes) |
| Asin | : | 3642173632 |
| Format Type | : | paperback |
| Number of Pages | : | 412 Pages |
| Publish Date | : | 2016-10-15 |
| Language | : | English |
DESCRIPTION:
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.
The book contains many interesting exercises that will stimulate the motivated reader to get a better understanding of this area. … The book is ideal as reference material or for a reading course for a dedicated graduate student. Cioab, Mathematical Reviews, January, 2013). 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. It has been extended with new and updated results. … The collection of topics covered is another big advantage of the book. … The book is nicely written and the author has included many elegant and beautiful proofs. … This textbook is suitable for advanced undergraduate or graduate students as well as researchers working in discrete mathematics o
Most of the remaining chapters also include new material, such as the KruskalKatona theorem on shadows, the LovászStein 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édiTrotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.This second editio
"Polya Lives" according to John Scott. A collection of gems from the field of extremal combinatorics, written in the informal but thorough style of George Polya. I very much enjoy browsing this book, especially at night, when I 'm looking for a digestible morsel to chew on before falling asleep. Like Polya, his writing style is both upbeat, lean and enthusiastic. The author doesn't dwell too much on any single problem a