Combinatorics, 2016 Fall, USTC
Instructor:
Teaching assistants:
Lecture outline will be updated during the semester
Week 1 ** Countings; Binomial Theorem; Estimating. Week 2 ** Inclusion¨CExclusion principle. Week 3 ** Generating function and its applications, including integer partition and Catalan number. Week 4 ** Random walk; Exponential generating function. Week 5 ** Baisc of graphs. Week 6 ** Spener's Lemma (a planar version)£» Double counting, including Sperner's Theorem. Week 7 ** Turan type problems (an upper bound on ex(n, C4) and Mantel's Theorem); Tree and Cayley¡¯s Formula (1st proof). Week 8 ** Cayley's Formula (2nd and 3rd proofs); Erdos-Ko-Rado Theorem (1st proof). Week 9 ** Erdos-Ko-Rado Theorem (2nd proof). Week 10 ** Partially ordered sets. Week 11 ** The Pigeonhole Principle; Ramsey's Theorem Week 12 ** Ramsey's Theorem (continued). Week 13 ** The Probabilistic Method. Week 14 ** The Probabilistic Method (continued). Week 15 ** The linear algebraic Method. Week 16 ** The linear algebraic Method (continued).Homeworks:
HW 1 . If you want to use the tex file of the problem set, download Tex1