- Textbook: A course in combinatorics - 2001 - van Lint, Wilson.pdf.
- midterm: 4.15 in class
- final 40 + midterm 30 + homework 20 + quiz 10
- Office Hour: Mon 13:45-15:45
Preliminary Schedule
- 1-4 basic graph theory
- trees
- Ramsey numbers
- Turan numbers
- 5-6 Hadamard Matrices
- 6-8 Projective Spaces
- 9 Designs
- 10 SRG
- 11 Generalized Quadrangles
- 12-13 General Spectral Graph theory
- 14 Association Schemes
- 15 Coding Theory
Midterm
I was asked about what the midterm will cover: Everything up to Baer subplanes. Not Hermitian unitals.
I have one question for trees, one for Ramsey, one for Turan, one for Hall, one for Hadamard, one for projective geometry.
The five best questions count. Each question is worth the same number of points.