Notes on introductory combinatorics
✍ Scribed by Pólya, George;Tarjan, Robert Endre;Woods, Donald R
- Publisher
- Birkhäuser
- Year
- 2010
- Tongue
- English
- Leaves
- 201
- Series
- Modern Birkhäuser Classics
- Edition
- Repr. of the 1983 ed
- Category
- Library
No coin nor oath required. For personal study only.
✦ Table of Contents
Introduction.- Combinations and Permutations.- Generating Functions.- Principle of Inclusion and Exclusion.- Stirling Numbers.- Polya'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.
✦ Subjects
Analiza kombinatoryczna;Biography
📜 SIMILAR VOLUMES
<p><P>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 subje
<p>In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over