Kohayakawa, YoshiharuYoshiharuKohayakawaMota, Guilherme OliveiraGuilherme OliveiraMotaSchacht, MathiasMathiasSchachtTaraz, AnuschAnuschTaraz2019-11-202019-11-202017-10European Journal of Combinatorics (65): 288-301 (2017-10)http://hdl.handle.net/11420/3829We present a variant of a universality result of Rödl (1986) for sparse, 3-uniform hypergraphs contained in strongly jumbled hypergraphs. One of the ingredients of our proof is a counting lemma for fixed hypergraphs in sparse “pseudorandom” hypergraphs, which is proved in the companion paper (Counting results for sparse pseudorandom hypergraphs I).en1095-99712017288301Journal Article10.1016/j.ejc.2017.04.007Other