Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Which is a good book to refresh discrete maths fundamentals for a grad student?

It would be great if the book has short and terse explanations of concepts with lots of worked out examples(/to be worked out exercises) to set the brain rolling.

Can someone suggest a similar refresher for graduate level algorithms?

share|cite|improve this question

migrated from Mar 1 '11 at 3:49

This question came from our site for theoretical computer scientists and researchers in related fields.


Concrete Mathematics by Knuth is useful as a refresher AFAIK. But this is not a research level question so not really belongs here :).

share|cite|improve this answer
Yes, you are right. Sorry about that. Where should i post this question? – Anonymous Mar 1 '11 at 3:06
math.Se is one possible location – Suresh Venkat Mar 1 '11 at 3:49

Kleinberg and Tardos is a good book. I followed this book for an Introductory Graduate Discrete Mathematics course. It starts from basics and covers a good amount of material in depth. Kleinberg and Tardos has a lot of Exercises at the end of each chapter.

Algorithms book by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani is an equally good book and is probably well-written than Kleinberg and Tardos. I have not read this book completely though.

share|cite|improve this answer

I don't think it's a graduate textbook, but I really like the discrete math book by Matousek and Nesetril. It presents the topics more succinctly than the standard discrete math undergraduate texts and has much more interesting exercises.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.