Combinatorics
by Béla Bollobás · Various
Lecture notes from a 1991 AMS short course edited by Béla Bollobás. Surveys of random graphs, martingale and isoperimetric inequalities, eigenvalue methods, branching processes and rapidly mixing Markov chains show how probabilistic arguments settle combinatorial problems.
This link may earn us a small commission at no extra cost to you. Affiliate disclosure
More resources on Discrete Mathematics
Discrete Mathematics and Its Applications
Standard undergraduate discrete mathematics textbook covering logic, proof, sets, functions, algorithms, number theory, counting, relations, graphs and trees, with thousands of exercises. Its relations chapter develops equivalence relations, partial orders, closures and matrix representations to a level suited to computer science study.
Art of Problem Solving Discrete Math
The Art of Problem Solving wiki's entry point for discrete mathematics, defining the field and branching into combinatorics, graph theory, set theory, number theory, and abstract algebra. Written for competition students, with links into AoPS problem archives.
Discrete Mathematics: An Open Introduction
Learn the fundamentals of discrete mathematics! Explore logic, sets, functions, and more with this open-source introductory website.
Mathematics for Computer Science (MIT 6.042J)
Discrete mathematics for computer science: logic and proof methods, induction, sets and relations, graph theory and coloring, number theory and congruences, asymptotic notation, counting, recurrences and discrete probability. This gallery holds 25 lecture videos; the course also offers problem sets and exams with solutions.
Discrete Mathematics: An Open Introduction
A free, open-licensed undergraduate textbook covering counting and combinatorics, sequences and recurrence relations, symbolic logic, proof techniques including induction, and graph theory, with many worked exercises. Readers build the discrete foundations needed for computer science and upper-level mathematics.
Algorithmic Aspects of Machine Learning (MIT 18.409)
Designing machine learning algorithms with provable guarantees: nonnegative matrix factorization, topic models, tensor decomposition, sparse recovery, dictionary learning and learning mixture models. Moitra's detailed lecture notes, which read as a complete monograph, and problem sets teach rigorous analysis of learning algorithms.