Facebook Twitter Pinterest
  • Statt: EUR 74,50
  • Sie sparen: EUR 1,50 (2%)
  • Alle Preisangaben inkl. MwSt.
Nur noch 2 auf Lager (mehr ist unterwegs).
Verkauf und Versand durch Amazon. Geschenkverpackung verfügbar.
Extremal Combinatorics: W... ist in Ihrem Einkaufwagen hinzugefügt worden
+ EUR 3,00 Versandkosten
Gebraucht: Wie neu | Details
Verkauft von ---SuperBookDeals---
Zustand: Gebraucht: Wie neu
Kommentar: 100% Geld zurueck Garantie. Zustand Wie neu. Schneller Versand, erlauben sie bitte 8 bis 18 Tage fuer Lieferung. Ueber 1,000,000 zufriedene Kunden. Wir bieten Kundenbetreuung in Deutsch.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Hörprobe Wird gespielt... Angehalten   Sie hören eine Hörprobe des Audible Hörbuch-Downloads.
Mehr erfahren
Alle 2 Bilder anzeigen

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series) (Englisch) Gebundene Ausgabe – 2. September 2011

Alle Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Neu ab Gebraucht ab
Gebundene Ausgabe, 2. September 2011
EUR 73,00
EUR 67,09 EUR 61,65
42 neu ab EUR 67,09 8 gebraucht ab EUR 61,65

Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.

  • Apple
  • Android
  • Windows Phone

Geben Sie Ihre E-Mail-Adresse oder Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.

Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.




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 in mathematics and computer science, has been successfully achieved.” (Sebastian M. Cioabă, Mathematical Reviews, January, 2013)


The book is a concise, self-contained and up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called gems of the theory. A wide spectrum of most powerful combinatorial tools is presented: methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A throughout discussion of some recent applications to computer science motivates the liveliness and inherent usefulness of these methods to approach problems outside combinatorics. No special combinatorial or algebraic background is assumed. All necessary elements of linear algebra and discrete probability are introduced before their combinatorial applications. Aimed primarily as an introductory text for graduates, it provides also a compact source of modern extremal combinatorics for researchers in computer science and other fields of discrete mathematics. -- Dieser Text bezieht sich auf eine andere Ausgabe: Gebundene Ausgabe.

Alle Produktbeschreibungen

In diesem Buch

(Mehr dazu)
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis
Hier reinlesen und suchen:


Es gibt noch keine Kundenrezensionen auf Amazon.de
5 Sterne
4 Sterne
3 Sterne
2 Sterne
1 Sterne

Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)

Amazon.com: HASH(0x9d4a7fe4) von 5 Sternen 2 Rezensionen
6 von 7 Kunden fanden die folgende Rezension hilfreich
HASH(0x9c4a8038) von 5 Sternen Polya Lives 31. Dezember 2010
Von John Scott - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe Verifizierter Kauf
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 and covers a lot ground for a single book, using concrete problems to illustrate a particular subject. The book reads as if the author is speaking directly to you.

I am professional programmer with a math background who very much recommends this book to a programmer looking to get a feel for the subject of combinatorics from a more than introductory point of view. I would have given 5 stars, but the editing is sloppy. Also, don't expect to start cutting code tomorrow. The book is much more a math book than computer science book.
3 von 4 Kunden fanden die folgende Rezension hilfreich
HASH(0x9c290cc0) von 5 Sternen A beautiful book! 10. März 2013
Von PST - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
The author covers exactly what the title promises: How to calculate bounds for combinatorial objects. To this end various methods are introduced and carefully explained.
The proofs are generally not too difficult - and many would qualify for Erdös' famous "God's book of perfect proofs"!

While the formal mathematical prerequisites are rather minimal, I feel the book requires some maturity in math. (However, I am just a hobby mathematician, so do not take this too seriously!)

The author, no question!, seems a master of his subject: The style or writing is "lean", every word counts, but one does never feel like anything is missing.

For anybody interested in "beautiful mathematics" this is certainly a book to read!

There a not too many typos in the book, and most of them are easily recognized, they do not distract at all.

The book contains many excercises ( with exhaustive hints), but I did not do them, so I cannot comment.
Waren diese Rezensionen hilfreich? Wir wollen von Ihnen hören.