|
Home
| Subject Search
| Help
| Symbols Help
| Pre-Reg Help
| Final Exam Schedule
| My Selections
|
Searched for: 1 subject found.
18.225 Graph Theory and Additive Combinatorics
(
)
Prereq: ((18.701 or 18.703) and (18.100A, 18.100B, 18.100P, or 18.100Q)) or permission of instructor
Units: 3-0-9
Introduction to extremal graph theory and additive combinatorics. Highlights common themes, such as the dichotomy between structure versus pseudorandomness. Topics include Turan-type problems, Szemeredi's regularity lemma and applications, pseudorandom graphs, spectral graph theory, graph limits, arithmetic progressions (Roth, Szemeredi, Green-Tao), discrete Fourier analysis, Freiman's theorem on sumsets and structure. Discusses current research topics and open problems.
Staff
| ||||||||
