Abstract: Extremal combinatorics broadly covers any kind of optimization where the structures you study are too discrete for smooth arguments to apply directly. So, it covers questions of the form: how large can a parameter be over a restricted class of sets or hypergraphs? I’ll introduce some problems of this kind and talk about a mixture of different results of mine from the last two and a half years.