Extremal combinatorics studies discrete objects such as graphs or finite set systems. We try to determine how large such a structure can be while satisfying certain conditions, and describe the extremal constructions.