A First Course in Combinatorial Mathematics (Oxford Applied Mathematics & Computing Science Series) [Paperback]

Ian Anderson (Author)

Book Description

Publication Date: October 12, 1989 | ISBN-10: 0198596731 | ISBN-13: 978-0198596738 | Edition: 2

Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introductory survey complete with easy-to-understand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the non-exclusion principle. It also provides a study of block designs, Steiner triple systems, and expanded coverage of the marriage theorem, as well as a unified account of three important constructions which are significant in coding theory.

Editorial Reviews

Review

' ...excellent introductory text...' Times Higher Education Supplement

'..happy introduction for many people...' Computer Journal

About the Author

Ian Anderson is at University of Glasgow.

Product Details

• Paperback: 144 pages
• Publisher: Oxford University Press, USA; 2 edition (October 12, 1989)
• Language: English
• ISBN-10: 0198596731
• ISBN-13: 978-0198596738
• Product Dimensions: 8.5 x 5.5 x 0.4 inches
• Shipping Weight: 7 ounces (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #2,569,654 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

4 of 5 people found the following review helpful:

4.0 out of 5 stars A First Course in Combinatorial Mathematics, April 2, 2000

By A Customer

This review is from: A First Course in Combinatorial Mathematics (Oxford Applied Mathematics & Computing Science Series) (Paperback)

This is a very good introduction to Combinatorics. It is filled with many examples and has problems that really reinforce the examples. Because it is well organized, it is very easy to use as a reference. I highly recommed it for anyone who is serious about studying Combinatorics.