---

Developed from the authors´ introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many tools used for determining the performance of computer algorithms.

---

"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pólya and Tarjan at Stanford University... One can count on [Pólya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory...[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading."

-Mathematical Reviews (Review of the original hardcover edition)

"The mathematical community welcomes this book as a final contribution to honour the teacher G. Pólya."

-Zentralblatt MATH (Review of the original hardcover edition)

---

Introduction.- Combinations and Permutations.- Generating Functions.- Principle of Inclusion and Exclusion.- Stirling Numbers.- Pólya´s Theory of Counting.- Outlook.- Midterm Examination.- Ramsey Theory.- Matchings (Stable Marriages).- Matchings (Maximum Matchings).- Network Flow.- Hamiltonian and Eulerian Paths.- Planarity and the Four-Color Theorem.- Final Examination.- Bibliography.

---

From the reviews:
"The purpose of this re-publication was to make modern classics books like this one remain accessible to new generations of students, scholars and researchers." (Zentralblatt MATH, Vol. 1195, 2010)

---