The following publications are possibly variants of this publication:
- An Approximate Blow-up Lemma for Sparse HypergraphsPeter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies. lagos 2021: 394-403 [doi]
- An Extension of the Blow-up Lemma to Arrangeable GraphsJulia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl. siamdm, 29(2):962-1001, 2015. [doi]
- A counting lemma for sparse pseudorandom hypergraphsYoshiharu Kohayakawa, G. O. Mota, Mathias Schacht, Anusch Taraz. endm, 50:421-426, 2015. [doi]
- Clique-factors in sparse pseudorandom graphsJie Han 0002, Yoshiharu Kohayakawa, Patrick Morris 0001, Yury Person. ejc, 82, 2019. [doi]