I'am reading the paper Elementary Submodels in Infinite Combinatorics from Soukup (http://eprints.renyi.hu/45/1/elementary_submodels_revised.pdf) 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.