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. 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.

*"synopsis" may belong to another edition of this title.*

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Quantity Available: 2

Seller

Rating

**Book Description **Book Condition: New. Depending on your location, this item may ship from the US or UK. Bookseller Inventory # 97808218415180000000

More Information About This Seller | Ask Bookseller a Question

Published by
American Mathematical Society, United States
(2007)

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **American Mathematical Society, United States, 2007. Hardback. Book Condition: New. Illustrated edition. 260 x 184 mm. Language: English . Brand New Book. 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 Gunter M. Ziegler has been an international success with translations into 12 languages. Bookseller Inventory # AAN9780821841518

More Information About This Seller | Ask Bookseller a Question

Published by
American Mathematical Society, United States
(2007)

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **American Mathematical Society, United States, 2007. Hardback. Book Condition: New. Illustrated edition. 260 x 184 mm. Language: English . Brand New Book. 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 Gunter M. Ziegler has been an international success with translations into 12 languages. Bookseller Inventory # AAN9780821841518

More Information About This Seller | Ask Bookseller a Question

Published by
American Mathematical Society
(2007)

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Quantity Available: 2

Seller

Rating

**Book Description **American Mathematical Society, 2007. HRD. Book Condition: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Bookseller Inventory # CE-9780821841518

More Information About This Seller | Ask Bookseller a Question

Published by
American Mathematical Society

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 2

Seller

Rating

**Book Description **American Mathematical Society. Hardback. Book Condition: new. BRAND NEW, Discrete Mathematics (Illustrated edition), 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 Gunter M. Ziegler has been an international success with translations into 12 languages. Bookseller Inventory # B9780821841518

More Information About This Seller | Ask Bookseller a Question

Published by
American Mathematical Society
(2007)

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **American Mathematical Society, 2007. Hardcover. Book Condition: New. Bookseller Inventory # DADAX0821841513

More Information About This Seller | Ask Bookseller a Question

Published by
Amer Mathematical Society
(2007)

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 2

Seller

Rating

**Book Description **Amer Mathematical Society, 2007. Hardcover. Book Condition: Brand New. illustrated edition. 388 pages. 10.00x7.00x1.00 inches. In Stock. Bookseller Inventory # __0821841513

More Information About This Seller | Ask Bookseller a Question

Published by
American Mathematical Society
(2007)

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **American Mathematical Society, 2007. Hardcover. Book Condition: New. book. Bookseller Inventory # 0821841513

More Information About This Seller | Ask Bookseller a Question

Published by
American Mathematical Society
(2007)

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 3

Seller

Rating

**Book Description **American Mathematical Society, 2007. Hardcover. Book Condition: New. Bookseller Inventory # P110821841513

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0821841513
ISBN 13: 9780821841518

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **2007. Hardcover. Book Condition: New. Illustrated edition. 259mm x 183mm x. Hardcover. The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book offers an int.Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. 388 pages. 0.860. Bookseller Inventory # 9780821841518

More Information About This Seller | Ask Bookseller a Question