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 presen
Extremal Combinatorics: With Applications in Computer Science
β Scribed by Stasys Jukna
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Leaves
- 390
- Series
- Texts in Theoretical Computer Science. An EATCS Series
- Edition
- 1st
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Subjects
ΠΠΎΠΌΠ±ΠΈΠ½Π°ΡΠΎΡΠΈΠΊΠ°
π SIMILAR VOLUMES
<p><p>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
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 presen