|מדעים מדויקים | מתמטיקה|
Combinatorics - Spring '12
Instructor: Dr. Asaf Shapira
Prerequisites to Combinatorics.First year courses in mathematics, most notably Discrete Mathematics or Introduction
Mathematics or Computer Science. We will cover more advanced topics compared to the course
Introduction to Combinatorics and Graph Theory (0366.1123). The level of difficulty will be comparable
to that of Introduction to Graph Theory (0366.3267).
We will cover and touch upon a variety of topics in Combinatorics, like Ramsey Theory, Extremal
Graph Theory, Extremal Set Theory, the Partition Function and Enumerative Problems.
We will also encounter a variety of tools and techniques, like Generating Functions, the Probabilistic
Method and tools from Linear Algebra.The course is intended for second and third year undergraduate students in
Suggested Reading: Combinatorics: Topics, Techniques, Algorithms, by P. Cameron, 1994. Invitation to Discrete Mathematics, by J. Matouˇsek and J. Neˇsetˇril (Second Edition), 2008.
(Second Edition), 2011.How to Count: An Introduction to Combinatorics, by R.B.J.T. Allenby and A. Slomson