Introduction to Enumerative Combinatorics

Front Cover
McGraw-Hill Education, 2007 - Mathematics - 526 pages
0 Reviews
Written by one of the leading authors and researchers in the field, this comprehensive modern text offers a strong focus on enumeration, a vitally important area in introductory combinatorics crucial for further study in the field. Miklós Bóna's text fills the gap between introductory textbooks in discrete mathematics and advanced graduate textbooks in enumerative combinatorics, and is one of the very first intermediate-level books to focus on enumerative combinatorics. The text can be used for an advanced undergraduate course by thoroughly covering the chapters in Part I on basic enumeration and by selecting a few special topics, or for an introductory graduate course by concentrating on the main areas of enumeration discussed in Part II. The special topics of Part III make the book suitable for a reading course.

This text is part of the Walter Rudin Student Series in Advanced Mathematics.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Direct Applications of Basic Methods
Generating Functions
Counting Permutations

7 other sections not shown

Common terms and phrases

Bibliographic information