ConceptTheory & Algos
(L, k, d)-design
A family of n subsets of 1 through l, each of size k, such that any two distinct ones have intersection size at most d.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Combinatorics2Subset2
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Ryan O'Donnell
Connections
4The lectures that define it or assume it, and the concepts next to it.