Jump to ratings and reviews
Rate this book

Applied Combinatorics

Rate this book
This is a revision of a one-semester survey of combinatorial analysis and graph theory, designed for mathematics and computer science majors. Three principal aspects of combinatorial reasoning are emphasized in this book: the systematic analysis of different possibilities, the exploration of the logical structure of a problem, and ingenuity. Keeping theory to a minimum, it uses numerical examples to demonstrate the combinatorial reasoning involved in computer science, operations research, and finite probability. This edition gives more attention to computer science's use of combinatorics. Includes a new chapter on topics in theoretical computer science, a new section on recursive programs, an enlarged discussion of algorithms to generate combinatorial sets, and additional programming exercises.

447 pages, Hardcover

First published December 31, 1978

10 people are currently reading
215 people want to read

About the author

Alan Tucker

77 books16 followers
Librarian Note: There is more than one author in the GoodReads database with this name.

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
20 (28%)
4 stars
22 (31%)
3 stars
19 (27%)
2 stars
6 (8%)
1 star
2 (2%)
Displaying 1 - 5 of 5 reviews
3 reviews
January 10, 2014
Alan Tucker was my professor in college. Combinatorics and Graph Theory were my absolute favorite subjects.
7 reviews
September 7, 2022
The maths high key slays, bought like 2 years ago but haven't finished it
Profile Image for Steve.
159 reviews1 follower
May 9, 2016
This was just an okay textbook. There are sections of this book that are very well written (when you get into the actual start of the Combinatorics section, the author does a fantastic job of introducing the subject, provides a LOT of examples, and really does a great job of explaining what is a tough subject to many people.

But there are sections that are just terribly done. The section on non-homogeous recurrence relations was very vague, and the examples were a bit poor. The early sections covering edge and vertex covers also weren't very well explained (especially given that easier solutions using logic formulas exist).

So, overall, not a terrible book, but it could definitely use some improvement.
Displaying 1 - 5 of 5 reviews

Can't find what you're looking for?

Get help and learn more about the design.