Math 511: Introduction to Combinatorics
Spring, 2019
Presentations

This is a list of items that can be used for class presentations, about 20 minutes each. [n] is an estimate of difficulty on a scale from 0 (very easy) to 5 (very hard).
  1. Turán's Theorem 4.1. (Matt F 2/1)
  2. Dirac's Theorem 4.3. (Nick F 2/1)
  3. König's Theorem 5.4. (Zach W 2/6)
  4. Hall's Theorem 5.1. (Joe F 2/8)
  5. Sperner's Theorem 6.3. (Jimmy M 2/11)
  6. Dilworth's Theorem 6.1. (Matt WF 2/13,15)
  7. Dual Dilworth 6.2. (Nick W 2/13)
  8. Symmetric chain decomposition, top of p. 55. (Zach WF 2/13,15)
  9. [3] Generalized Sperner by Meshalkin et al. from Beck-Zaslavsky paper. (Jimmy F 2/18)
  10. [1] Problem 7A.
  11. [2] Theorem 7.3. (Zach F 2/22)
  12. [1] Example 10.2. (Matt M 2/25)
  13. [2] P. 91, ¶2 beginning "Let P(x)". (Nick M 2/25)
  14. [1] Example 10.4. (Jimmy M 2/25)
  15. [2] Theorem 15.6. (Zach W 4/3)
  16. [3] Theorem 15.11. (Nick W 4/3)
  17. [2] Theorem 16.1, proof on p. 172. (Matt F 4/5)
  18. [3] Theorem 16.2. (Jimmy F 4/5)
  19. [2] Theorem 19.1. (Matt M 4/15)
  20. [1] Example 19.3. (Jimmy F 4/12)
  21. [2] Example 19.6, including finding an S(2,4,13) if you can. (Matt M 4/22)
  22. [2] Theorem 19.9. (Nick M 4/22)
  23. [2] Theorem 19.10. (Zach M 4/22)
  24. [1] Example 19.11. (Nick W 4/24)
  25. [2] Example 19.12. (Jimmy W 4/24)
  26. [1] Theorem 22.3(i), proof, especially orthogonality.
  27. [2] Theorem 22.4, including p. 289 top. (Zach W 5/1)
  28. [2] Theorem 22.5. (Jimmy F 5/3)
  29. [1] Example 23.5. (Matt F 5/3)
  30. [2] Theorem 24.1. (Nick F 5/10)
  31. [1] Theorem 25.2. (Jimmy W 5/10)
  32. [1] Theorem 26.1(a). (Zach W 5/10)
  33. [2] Example 26.1.
Totals: Jimmy 8, Matt 7, Nick 7, Zach 7.
Main course page | Syllabus | Notes | Assignments
My home page