A Path to Combinatorics for Undergraduates Counting Strategies

From the reviews:

"A good foundation in combinatorics is provided in the early chapters that cover ideas in combinatorial geometry…. This book serves as a solid stepping stone for more advanced combinatorics studies in related mathematical science fields or in computer science."

— L'Enseignement Mathématique

"This book is an introduction to counting strategies in combinatorial theory. The main mathematical ideas are carefully worked into organized, challenging, and instructive examples given in the nine chapters of this book. In the last chapter we find 111 problems (without solutions). The greater part of them are from various mathematical contests. The…experience of the authors in preparing students for various mathematical competitions allowed them to present a big collection of beautiful problems. By studying this book, undergraduates will be well-equipped to further their knowledge in more abstract combinatorics and its related fields."

—MAA Online

"...the book provides quite an amazing collection of combinatorial problems, many of them original, and many of them from a hard to find sources like Russian olympiads. (...) The presentation of the solutions is very clear and instructive, with emphasis on common mistakes."

—Mathematics Bohemica

"The goal of the book is to explain the main concepts and ideas of combinatorics to undergraduate students. Extremely helpful is the extensive use of examples for explanation purposes, which makes this book so pleasant to read. All the ideas and problems are addressed by giving rich examples, and what is even more, each example is solved in high detail immediately after it is posed. … So it is highly recommended to read everything in the book." (Simon Seichter, Simulation News Europe, Vol. 16 (1), 2006)