There are many theorems in extremal combinatorics (e.g. the Erdos-Ko-Rado theorem, the Kruskal-Katona theorem) that can be proved via “shifting” arguments. See for example the following blogpost by Gil Kalai.
I would like to understand this technique to apply it to a problem I’m working on. Is there a good (and hopefully somewhat recent) survey of such results?