Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled trees, algebraic, D-finite, and noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course and focusing on combinatorics, especially the Robinson–Schensted–Knuth algorithm. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including jeu de taquin and the Littlewood–Richardson rule. The exercises in the book play a vital role in developing the material, and this second edition features over 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions.

‘This is one of the great books; readable, deep and full of gems. It brings algebraic combinatorics to life. I teach out of it and feel that if I can get my students to 'touch Stanley' I have given them a gift for life.’

Persi Diaconis - Stanford University

‘It is wonderful to celebrate the completion of the second edition of Richard Stanley's Enumerative Combinatorics, one of the finest mathematical works of all time. He has added nearly 200 exercises, together with their answers, to what was already a uniquely masterful summary of a vast and beautiful theory. When paired with the second edition of Volume 1, his two classic volumes will surely be a timeless treasure for generations to come.’

Donald E. Knuth - Stanford University

‘An updated classic with a mesmerizing array of interconnected examples. Through Stanley's masterful exposition, the current and future generations of mathematicians will learn the inherent beauty and pleasures of enumeration.’

June Huh - Princeton University

‘I have used Richard Stanley's books on Enumerative Combinatorics numerous times for the combinatorics classes I have taught. This new edition contains many new exercises, which will no doubt be extremely useful for the next generation of combinatorialists.’

Anne Schilling - University of California, Davis

‘Richard Stanley's Enumerative Combinatorics, in two volumes, is an essential reference for researchers and graduate students in the field of enumeration. Volume 2, newly revised, includes comprehensive coverage of composition and inversion of generating functions, exponential and algebraic generating functions, and symmetric functions. The treatment of symmetric functions is especially noteworthy for its thoroughness and accessibility. Engaging problems and solutions, and detailed historical notes, add to the value of this book. It provides an excellent introduction to the subject for beginners while also offering advanced researchers new insights and perspectives.’

Ira Gessel - Brandeis University