Handbook of Discrete and Combinatorial Mathematics, Second Edition (Hardcover)

~ (Editor) "This chapter covers material usually referred to as the foundations of mathematics, including logic, sets, and functions..." (more)
Key Phrases: hyperline sequences, minimum realizer, projective line arrangement, Monte Carlo, Academic Press, Las Vegas (more...)

Editorial Reviews

Review

I like the book's format. There are glossaries at the beginning of each chapter. Each subsection begins with definitions and goes on to facts, then algorithms (boxed and in pseudo -code), lists of mathematical objects, illuminating pictures, examples, lists of applications, and, finally, bibliography and web sources. This handbook will appeal both to pure and to applied mathematicians. Its 17 chapters, and 115 subsections were produced by 77 individuals, kept nicely in line (no mean task) by five editors who, in turn, got the go-ahead signal and the prestige of an advisory editorial board of 23 distinguished authorities.
--SIAM News -June 2001

I like the books format. There are glossaries at the beginning of each chapter. Each subsection begins with definitions and goes on to facts, then algorithms (boxed and in pseudo -code), lists of mathematical objects, illuminating pictures, examples, lists of applications, and, finally, bibliography and web sources. This handbook will appeal both to pure and to applied mathematicians. Its 17 chapters, and 115 subsections were produced by 77 individuals, kept nicely in line (no mean task) by five editors who, in turn, got the go-ahead signal and the prestige of an advisory editorial board of 23 distinguished authorities.
--SIAM News -June 2001

No other book covers such a wide range of topics in discrete mathematics…a useful resource.
--CHOICE Magazine

No other book covers such a wide range of topics in discrete mathematics…a useful resource.
--CHOICE Magazine

intended to provide a user a quick and concise look up facility for definitions, basic facts, algorithms, standard examples, tables, printed references and URLs for the various objects of discrete mathematics. Thus it will be a valuable supplement in any library.
-Monatshefte fur Mathematics, Volume 134, No. 3, 2002

…a valuable reference tool for professionals and students using discrete mathematics…The coverage is vast…This book is a must-buy for research libraries.
--Journal of Mathematical Psychology, February 2002

…a valuable reference tool for professionals and students using discrete mathematics…The coverage is vast…This book is a must-buy for research libraries.
--Journal of Mathematical Psychology, February 2002

Product Description

The importance of discrete mathematics has increased dramatically within the last few years but until now, it has been difficult-if not impossible-to find a single reference book that effectively covers the subject. To fill that void, The Handbook of Discrete and Combinatorial Mathematics presents a comprehensive collection of ready reference material for all of the important areas of discrete mathematics, including those essential to its applications in computer science and engineering. Its topics include:oLogic and foundationsoCountingoNumber theoryoAbstract and linear algebraoProbabilityoGraph theoryoNetworks and optimizationoCryptography and codingoCombinatorial designsThe author presents the material in a simple, uniform way, and emphasizes what is useful and practical. For easy reference, he incorporates into the text:oMany glossaries of important termsoLists of important theorems and formulasoNumerous examples that illustrate terms and conceptsoHelpful descriptions of algorithmsoSummary tablesoCitations of Web pages that supplement the textIf you have ever had to find information from discrete mathematics in your work-or just out of curiosity-you probably had to search through a variety of books to find it. Never again. The Handbook of Discrete Mathematics is now available and has virtually everything you need-everything important to both theory and practice.

Product Details

• Hardcover: 1232 pages
• Publisher: CRC; 1 edition (September 28, 1999)
• Language: English
• ISBN-10: 0849301491
• ISBN-13: 978-0849301490
• Product Dimensions: 10.3 x 7.1 x 2.5 inches
• Shipping Weight: 5 pounds (View shipping rates and policies)
• Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon.com Sales Rank: #361,100 in Books (See Bestsellers in Books)

  Popular in these categories: (What's this?)

  #60 in	Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Combinatorics
  #79 in	Books > Science > Mathematics > Pure Mathematics > Combinatorics

Customer Reviews

Most Helpful Customer Reviews

7 of 7 people found the following review helpful:

5.0 out of 5 stars Excellent, April 16, 2004

By	dl - See all my reviews

At the university I am attending Johnsonbaugh's book was a required text for a subject introducing discrete mathematics. Unfortunately, like many others it seems, I was less than impressed with the books ability 'teach', or even reinforce what we had just studied in lectures. I went looking for another book, not so much as a replacement for Johnsonbaugh's book, but as an additional reference/study aid.

Since owning this book I've found myself turning to it for explanations and examples over the required text. Almost every section lists definitions of terms, a bunch of useful facts and fully worked examples. Explanations and examples are clear and concise, while the facts often help to understand the process involved before getting into the examples.

I'd like to stress that this is certainly no replacement for a text book in discrete/combinatorial mathematics, however it is marvelous to have by your side to provide additional help through problem areas.

7 of 9 people found the following review helpful:

5.0 out of 5 stars Amazingly comprehensive, January 6, 2000

By A Customer

This book will occupy a prime spot on my bookshelf. I've had to use a bunch of different books to find this kind of information before. It's nice to see such a wide range of topics from discrete math covered so thoroughly.