Progress in Computer Science and Applied Logic

Notes on Introductory Combinatorics

Authors: Pólya, George, Tarjan, Robert E., Woods, Donald R.

Free Preview
  • An affordable new softcover edition of a classic text
  • Offers a comprehensive introductory overview of combinatorics
  • Includes homework exercises and examinations, making the book useful in courses
  • Results serve as a basis for applications in computer science
see more benefits

Buy this book

eBook $19.99
price for USA in USD
  • ISBN 978-0-8176-4953-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
About this Textbook

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 analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pólya’s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths.

 

This introduction will provide students with a solid foundation in the subject.

 

----

 

"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. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhäuser publishers produced a very pleasant text.

 

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)

Table of contents (16 chapters)

Table of contents (16 chapters)
  • Introduction

    Pages 1-1

    Pólya, George (et al.)

  • Combinations and Permutations

    Pages 2-10

    Pólya, George (et al.)

  • Generating Functions

    Pages 11-31

    Pólya, George (et al.)

  • Principle of Inclusion and Exclusion

    Pages 32-40

    Pólya, George (et al.)

  • Stirling Numbers

    Pages 41-54

    Pólya, George (et al.)

Buy this book

eBook $19.99
price for USA in USD
  • ISBN 978-0-8176-4953-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Notes on Introductory Combinatorics
Authors
Series Title
Progress in Computer Science and Applied Logic
Series Volume
4
Copyright
2010
Publisher
Birkhäuser Basel
Copyright Holder
Birkhäuser Boston
eBook ISBN
978-0-8176-4953-1
DOI
10.1007/978-0-8176-4953-1
Series ISSN
2297-0576
Edition Number
1
Number of Pages
XII, 192
Number of Illustrations
125 b/w illustrations
Topics