Introductory Combinatorics

by Richard A. Brualdi

Appropriate for one- or two-semester, junior- to senior-level combinatorics courses.
This trusted best-seller covers the key combinatorial ideas–including the pigeon-hole principle, counting techniques, permutations and combinations, Pólya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises.

Genres: Mathematics, Nonfiction, Reference, Textbooks

648 pages, Hardcover

First published March 1, 1977

Reviews

[Rachel]

For the most part I found it to be very boring and not as useful as I hoped. I found myself constantly having to go to outside sources to do effective studying, which I normally do anyway; but instead of the outside sources being supplementary to the text, they had become primary over the text.

[Daniel Hoffman]

This was required for a course. Pretty good introductory text, and the book did a good job of explaining topics when they needed expanding upon, and keeping a decent pace in general.

[Amr Elseweifi]

This books was not good at all. Constantly skips steps and assumes stuff is self-evident.

[Tianyi Cui]

The book taught me Combinatorics in my senior middle school. Very interesting to read. Recommended to everyone who starts to learn Combinatorics.

[Hannah Thomas]

If you're into a different kind of counting about mathematics, here you go! ;)

[Dipan Laha]

Very good

[Joe Cole]

This is very special topic and this textbook is great if you take this course.