1. Introduction --;2. Combinations and Permutations --;3. Generating Functions --;4. Principle of Inclusion and Exclusion --;5. Stirling Numbers --;6. Plyas Theory of Counting --;7. Outlook --;8. Midterm Examination --;9. Ramsey Theory --;10. Matchings (Stable Marriages) --;11. Matchings (Maximum Matchings) --;12. Network Flow --;13. Hamiltonian and Eulerian Paths --;14. Planarity and the Four-Color Theorem --;15. Final Examination --;16. Bibliography.
SUMMARY OR ABSTRACT
Text of Note
In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.