2007;
388 pp;
Hardcover

MSC: Primary 05; 06; 11; 90; 94;

Print ISBN: 978-0-8218-4151-8

Product Code: DISCMAT

List Price: $65.00

Individual Member Price: $52.00

**Electronic ISBN: 978-1-4704-1138-1
Product Code: DISCMAT.E**

List Price: $65.00

Individual Member Price: $52.00

#### You may also like

#### Supplemental Materials

# Discrete Mathematics

Share this page
*Martin Aigner*

The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints and solutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level.

Praise for the German edition…

This book is a well-written introduction to discrete mathematics and is highly recommended to every student of mathematics and computer science as well as to teachers of these topics.

—Konrad Engel for MathSciNet

Martin Aigner is a professor of mathematics at the Free University
of Berlin. He received his PhD at the University of Vienna and has
held a number of positions in the USA and Germany before moving to
Berlin. He is the author of several books on discrete mathematics,
graph theory, and the theory of search. The Monthly article
Turan's graph theorem earned him a 1995 Lester R. Ford Prize
of the MAA for expository writing, and his book Proofs from the
BOOK with Günter M. Ziegler has been an international
success with translations into 12 languages.

#### Table of Contents

# Table of Contents

## Discrete Mathematics

- Cover Cover11 free
- Title iii4 free
- Copyright iv5 free
- Contents v6 free
- Prefaces ix10 free
- Part 1. Counting 114 free
- Bibliography for Part 1 113126
- Part 2.Graphs and Algorithms 115128
- Bibliography for Part 2 233246
- Part 3. Algebraic Systems 235248
- Bibliography for Part 3 353366
- Solutions to Selected Exercises 355368
- Index 383396
- Back Cover Back Cover1402

#### Readership

Undergraduates and graduate students interested in discrete mathematics, algorithms, and combinatorics.

#### Reviews

Aigner offers a very enjoyable review of discrete mathematics at the graduate level.