Graph Theory and Additive Combinatorics
MIT OCW 18.217
Explore graph theory and additive combinatorics! This course covers key concepts and applications in graphs & digraphs.
More resources on Combinatorics
Wolfram MathWorld
MathWorld is an online mathematics encyclopedia from Wolfram Research offering detailed, browsable articles on topics across the math spectrum, including algebra, geometry, calculus, and number theory. Each entry includes definitions, theorems, formulas, diagrams, worked examples, and links to further reading.
Enumerative Combinatorics, Volume 1
Graduate-level reference on counting: sieve methods, partially ordered sets and Möbius inversion, rational generating functions, and permutation statistics such as descents and inversions. Its exercises, each rated by difficulty and with solutions, train readers to find bijective and generating-function proofs.
Probabilistic Methods in Combinatorics (MIT 18.226)
A graduate introduction to proving combinatorial objects exist by showing random constructions work with positive probability: linearity of expectation, alterations, second moment method, Lovász local lemma, and concentration inequalities. 11 lecture videos, lecture notes, Zhao's open textbook and problem sets.
Graph Theory and Additive Combinatorics (MIT 18.225)
Classical and modern results linking graph theory and additive combinatorics: Turán-type extremal problems, Szemerédi's regularity lemma, pseudorandom graphs, graph limits, Roth's theorem and Freiman's theorem, plus open problems. 26 lecture videos, lecture notes, Zhao's open textbook and problem sets.
Art of Problem Solving - Combinatorics
The Art of Problem Solving wiki's combinatorics hub, linking concise articles on counting principles, permutations, combinations, the binomial theorem, stars and bars, and inclusion-exclusion, with competition problems. Suited to students preparing for contests such as AMC and AIME.
Mathematics for Computer Science (MIT 6.042J)
Discrete mathematics for computer science with an emphasis on definitions and proofs: logic, induction, sets and relations, graph theory, modular arithmetic, asymptotics, counting and discrete probability. 25 lecture videos, problem sets and exams with solutions build fluency in writing proofs.