Extremal Combinatorics

With Applications in Computer Science
2001. Buch. XVII, 375 S.: 36 s/w-Abbildungen. Hardcover
Springer ISBN 978-3-540-66313-3
Format (B x L): 15,5 x 23,5 cm
Gewicht: 706 g
In englischer Sprache
Das Werk ist Teil der Reihe:
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 illustrates the inherent usefulness of these methods.
lieferbar, ca. 10 Tage
85,59 €
inkl. MwSt.
Provides an introductory, self-contained and up-to-date source in extremal combinatorics suitable for a broad community: mathematicians, computer scientists, and engineers Covers a substantial part of the field of combinatorics Presents unexpected connections between classical combinatorics, probability and linear algebra Proofs are extremely elegant and given in full details