图论与组合 (Fall 2011)

Table of Contents

News

  • 2011/09/24: 添加了简要的课程说明。
  • 2011/09/21: Homework2，下周三课前交。
  • 2011/09/21: 更新课程提纲文件。Exercise3.2, 3.3, 以及Theorem3.5的证明细节作为练习。

Lecture Notes

下面是简要的课堂内容提纲。文件在每节课后更新。 希望大家积极提供反馈，补充和指正。

(ps) - (pdf)

  1. Lecture 1, 2011/09/07 Basic counting, binomial numbers.
  2. Lecture 2, 2011/09/14 Combinatorial proofs, Catalan numbers.
  3. Lecture 3, 2011/09/21 Principle of Inclusion-Exclusion, Mobius inversion.

Homework

作业一般在周三的课前交。也可以将ps或pdf文件email给我。

  1. Homework1 : (tex) - (ps) - (pdf)
  2. Homework2 截止2011/09/28 10am : (tex) - (ps) - (pdf)

Course Description

Description: This course serves as a broad exploration in the field of combinatorics, with a focus on the topics in or related to the theory of graphs and hyper-graphs. The course stars with the basic enumerative combinatorics, including combinatorial proofs in counting, the inclusion-exclusion principle and Mobius inversion, recursion and generating functions. Then we will discuss many interesting topics and techniques, including Ramsey theorems, extremal graph theory, conbinatorial designs, combinatorial geometry, graph matching, connectivity, planarity, and colouring, random graphs, Szemeredi's regularity lemma, the probabilistic method, and the algebraic method. We will adore the legendary Erdos and his co-authors, and attack open problems. The course will be self-contained. The students are assumed to have the basic ability in problem solving.

Textbook(s)

教科书：

  • J.H. van Lint and R. M. Wilson, A Course in Combinatorics (2nd ed). Combridge University Press, 2001.

Contact

陈晓敏 gougle [at] gmail [dot] com

个人工具