Kohayakawa, YoshiharuYoshiharuKohayakawaMota, Guilherme OliveiraGuilherme OliveiraMotaSchacht, MathiasMathiasSchachtTaraz, AnuschAnuschTaraz2020-06-182020-06-182015Electronic Notes in Discrete Mathematics (50): 421-426 (2015)http://hdl.handle.net/11420/6365We establish so-called counting lemmas that allow embeddings of certain hyper-graphs into sparse "pseudorandom" hypergraphs. As an application, we present a variant of a universality result of Rödl for sparse, 3-uniform hypergraphs contained in strongly pseudorandom hypergraphs.en1571-0653Electronic notes in discrete mathematics2015421426Elsevier ScienceembeddingshypergraphspseudorandomnessMathematikA counting lemma for sparse pseudorandom hypergraphsJournal Article10.1016/j.endm.2015.07.070Other