Extremal combinatorics

Auteurs

• Stasys Jukna

Paramètres

• 375 pages
• 14 heures de lecture

• Informatique, programmation
• Mathématiques

En savoir plus sur le livre

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.

Achat du livre

• Année de publication: 2001
• Reliure: (rigide)