Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

4.54 avg rating
( 13 ratings by Goodreads )
 
9783642269905: Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)
View all copies of this ISBN edition:
 
 

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.

"synopsis" may belong to another edition of this title.

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.

Review:

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)

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 89.95
US$ 79.88

Convert currency

Shipping: US$ 7.94
From United Kingdom to U.S.A.

Destination, rates & speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Stasys Jukna (author)
Published by Springer Berlin Heidelberg 2013-11-27, Berlin (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New paperback Quantity Available: 10
Seller:
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description Springer Berlin Heidelberg 2013-11-27, Berlin, 2013. paperback. Condition: New. Seller Inventory # 9783642269905

More information about this seller | Contact this seller

Buy New
US$ 79.88
Convert currency

Add to Basket

Shipping: US$ 7.94
From United Kingdom to U.S.A.
Destination, rates & speeds

2.

Jukna, Stasys
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2013. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9783642269905

More information about this seller | Contact this seller

Buy New
US$ 87.42
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

3.

Jukna, Stasys
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Quantity Available: 1
Seller:
Rating
[?]

Book Description Condition: New. Publisher/Verlag: Springer, Berlin | With Applications in Computer Science | Extremal Combinatorics provides a concise, up-to-date introduction to extremal combinatorics for nonspecialists. The text emphasizes theorems with particularly elegant and informative proofs, and presents a wide range of combinatorial tools. | 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. | Preface.- Prolog: What this Book Is About.- Notation.- Counting.- Advanced Counting.- Probabilistic Counting.- The Pigeonhole Principle.- Systems of Distinct Representatives.- Sunflowers.- Intersecting Families.- Chains and Antichains.- Blocking Sets and the Duality.- Density and Universality.- Witness Sets and Isolation.- Designs.- The Basic Method.- Orthogonality and Rank Arguments.- Eigenvalues and Graph Expansion.- The Polynomial Method.- Combinatorics of Codes.- Linearity of Expectation.- The Lovász Sieve.- The Deletion Method.- The Second Moment Method.- The Entropy Function.- Random Walks.- Derandomization.- Ramseyan Theorems for Numbers.- The Hales-Jewett Theorem.- Applications in Communications Complexity.- References.- Index. | Format: Paperback | Language/Sprache: english | 510 gr | 239x154x22 mm | 412 pp. Seller Inventory # K9783642269905

More information about this seller | Contact this seller

Buy New
US$ 90.04
Convert currency

Add to Basket

Shipping: US$ 3.21
From Germany to U.S.A.
Destination, rates & speeds

4.

STASYS JUKNA
Published by Springer (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Paperback Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description Springer, 2013. Paperback. Condition: NEW. 9783642269905 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0434790

More information about this seller | Contact this seller

Buy New
US$ 85.83
Convert currency

Add to Basket

Shipping: US$ 10.55
From United Kingdom to U.S.A.
Destination, rates & speeds

5.

Jukna, Stasys
Published by Springer (2016)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Paperback Quantity Available: 1
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description Springer, 2016. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9783642269905_lsuk

More information about this seller | Contact this seller

Buy New
US$ 91.37
Convert currency

Add to Basket

Shipping: US$ 5.12
From United Kingdom to U.S.A.
Destination, rates & speeds

6.

Stasys Jukna
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2013. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # LQ-9783642269905

More information about this seller | Contact this seller

Buy New
US$ 97.82
Convert currency

Add to Basket

Shipping: US$ 11.90
From United Kingdom to U.S.A.
Destination, rates & speeds

7.

Stasys Jukna
Published by Springer Berlin Heidelberg Nov 2013 (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Taschenbuch Quantity Available: 1
Seller:
Rheinberg-Buch
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description Springer Berlin Heidelberg Nov 2013, 2013. Taschenbuch. Condition: Neu. Neuware - 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. 436 pp. Englisch. Seller Inventory # 9783642269905

More information about this seller | Contact this seller

Buy New
US$ 90.04
Convert currency

Add to Basket

Shipping: US$ 20.01
From Germany to U.S.A.
Destination, rates & speeds

8.

Stasys Jukna
Published by Springer Berlin Heidelberg Nov 2013 (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Taschenbuch Quantity Available: 1
Seller:
BuchWeltWeit Inh. Ludwig Meier e.K.
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description Springer Berlin Heidelberg Nov 2013, 2013. Taschenbuch. Condition: Neu. Neuware - 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. 436 pp. Englisch. Seller Inventory # 9783642269905

More information about this seller | Contact this seller

Buy New
US$ 90.04
Convert currency

Add to Basket

Shipping: US$ 20.01
From Germany to U.S.A.
Destination, rates & speeds

9.

Stasys Jukna
Published by Springer
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description Springer. Paperback. Condition: New. 308 pages. Dimensions: 9.4in. x 6.5in. x 1.1in.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 KruskalKatona theorem on shadows, the LovszStein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvirs solution of the finite field Kakeya conjecture, Mosers algorithmic version of the Lovsz Local Lemma, Schnings algorithm for 3-SAT, the SzemerdiTrotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Seller Inventory # 9783642269905

More information about this seller | Contact this seller

Buy New
US$ 120.29
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds

10.

Stasys Jukna
Published by Springer Berlin Heidelberg Nov 2013 (2013)
ISBN 10: 3642269907 ISBN 13: 9783642269905
New Taschenbuch Quantity Available: 1
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)
Rating
[?]

Book Description Springer Berlin Heidelberg Nov 2013, 2013. Taschenbuch. Condition: Neu. Neuware - 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. 436 pp. Englisch. Seller Inventory # 9783642269905

More information about this seller | Contact this seller

Buy New
US$ 90.04
Convert currency

Add to Basket

Shipping: US$ 34.45
From Germany to U.S.A.
Destination, rates & speeds

There are more copies of this book

View all search results for this book