Extremal Combinatorics

With Applications in Computer Science

Auteurs

• Stasys Jukna

Paramètres

• 436 pages
• 16 heures de lecture

• Informatique, programmation
• Mathématiques

En savoir plus sur le livre

Focusing on elegant theorems and informative proofs, this book serves as a concise introduction to extremal combinatorics for nonspecialists. It covers a variety of combinatorial tools, making complex concepts accessible and engaging. The text aims to enhance understanding of extremal problems in combinatorics through clear explanations and a structured approach.

Achat du livre

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