Extremal Combinatorics With Applications in Computer Science |
|
| Author:
| Jukna, S. |
| Series title: | Eatcs Texts in Theoretical Computer Science Ser. |
| ISBN: | 978-3-540-66313-3 |
| Publication Date: | Jan 1999 |
| Publisher: | Springer
|
| Book Format: | Hardback |
| List Price: | AUD $147.95 |
Book Description:
|
This is a concise, 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 the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science...
More DescriptionThis is a concise, 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 the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods.