I'am reading the paper *Elementary submodels in infinite combinatorics* by Soukup ([arXiv link](https://arxiv.org/abs/1007.4309)) and there are a lot of proofs using elementary submodels, such as the proof of $\Delta$-system lemma and partitions theorems. However, I don't take the intuition and I would like more examples of the applications of elementary submodels. Anyone knows goods references for it in infinite combinatorics, specially in partition theory?

Thanks.