Blow-up lemma for cycles in sparse random graphs

Miloš Trujić

In a recent work, Allen, Böttcher, Hàn, Kohayakawa, and Person provided a first general analogue of the blow-up lemma applicable to sparse (pseudo)random graphs thus generalising t…