Kohayakawa, YoshiharuYoshiharuKohayakawaMota, Guilherme OliveiraGuilherme OliveiraMotaSchacht, MathiasMathiasSchachtTaraz, AnuschAnuschTaraz2019-11-202019-11-202017-10European Journal of Combinatorics (65): 276-287 (2017-10)http://hdl.handle.net/11420/3830We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs (Kohayakawa et al., 2004). Applications of our result are presented in the companion paper (Counting results for sparse pseudorandom hypergraphs II).1095-99712017276287Journal Article10.1016/j.ejc.2017.04.008Other