Notes on Introductory Combinatorics
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 su...
| Main Authors: | , , |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston :
Birkhäuser Boston,
2010.
|
| Edition: | 1st. |
| Series: | Modern Birkhäuser Classics
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- Combinations and Permutations
- Generating Functions
- Principle of Inclusion and Exclusion
- Stirling Numbers
- P#x00F3;lya#x2019;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.