图论与组合 (Fall 2011)

Table of Contents

News

  • 更新了讲义。添加了Property B下界的详细证明。（这个证明和Alon-Spencer书里的相同，讲义里可能更严格和详细。）
  • 2011/11/09: Hw7，下周三（11/16）交。
  • 2011/10/20: 添加了和近期课程有关的推荐读物。

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.
  4. Lecture 4, 2011/09/26 Mobius inversion on numbers, and a little preview of incidence algebra.
  5. Lecture 5, 2011/09/28 Stirling numbers.
  6. Lecture 6, 2011/10/10 Basic concepts in graphs.
  7. Lecture 7, 2011/10/12 More basic concepts in graphs.
  8. Lecture 8, 2011/10/19 The pigeon hole principle, the Ramsey principle.
  9. Lecture 9, 2011/10/24 Problems from the homeworks; Hypergraphs, Ramsey theorem, Erdos-Szekeres theorem, and Erdos' theorem on sum-free subsets.
  10. Lecture 10, 2011/11/02 Problems from the homeworks and the midterm; The probabilistic method, linearity of expectation.
  11. Lecture 11, 2011/11/07 Probability methods, alterations. Ramsey numbers. Graphs with big girth and big chromatic number.
  12. Lecture 12, 2011/11/09 Probability methods, property B.

Homework

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

  1. Homework1 : (tex) - (ps) - (pdf)
  2. Homework2 : (tex) - (ps) - (pdf)
  3. Homework3 : (tex) - (ps) - (pdf)
  4. Homework4 : (tex) - (ps) - (pdf)
  5. Homework5 : (tex) - (ps) - (pdf)
  6. Homework6 : (tex) - (ps) - (pdf)
  7. Homework7 截止2011/11/16 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) and Articles

教科书：

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

推荐读物：

  • B. Bollobas: Combinatorics. Combridge University Press, 1986.
  • R. Stanley: Enumerative Combinatorics Vol 1, Combridge University Press, 2000.
  • H. Wilf: Generatingfunctionology, A K Peters, 2006. (Also available online)
  • R. Graham, B. Rothschild, and J. Spencer: Ramsey Theory (2nd ed). Wiley-Interscience, 1990.
  • N. Alon and J. Spencer: The probabilistic Method (3rd ed). Wiley-Interscience, 2008.
  • A. Bondy and U.S.R. Murty: Graph Theory with Applications. Elsevier Science Ltd/North-Holland, 1976.
  • A. Bondy and U.S.R. Murty: Graph Theory. Springer 2010.
  • B. Bollobas: Modern Graph Theory. Springer, 1998.
  • D. West: Introduction to Graph Theory (2nd ed). Prentice Hall, 2000.
  • M. Aigner, G. Ziegler, and K. Hofmann: Proofs from the BOOK (4th ed). Springer, 2009.
  • Articles about Paul Erdos: http://www.ams.org/notices/199801/comm-erdos.pdf

Contact

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

个人工具