Introduction to Enumerative Combinatorics

Divided into three parts, this book fills in the gap between introductory texts in discrete mathematics and advanced graduate textbooks in enumerative combinatorics. Part I deals with basic counting principles, compositions and partitions, and generating functions. Part II focuses on the structure of permutations, graph enumeration, and extremal combinatorics. Finally, Part III covers supplemental topics, including error-correcting codes, properties of sequences, and magic squares.

Miklos Bona received his Ph.D in mathematics from the Massachusetts Institute of Technology in 1997. Since 1999, he has taught at the University of Florida, where, in 2010, he was inducted into the Academy of Distinguished Teaching Scholars. Professor Bona has mentored numerous graduate and undergraduate students. He is the author of four books and more than 65 research articles, mostly focusing on enumerative and analytic combinatorics. His book,Combinatorics of Permutations, won a 2006 Outstanding Title Award from Choice, the journal of the American Library Association. He is also an editor-in-chief for theElectronic Journal of Combinatorics, and for two book series at CRC Press.