Options
Counting results for sparse pseudorandom hypergraphs II
Publikationstyp
Journal Article
Date Issued
2017-10
Sprache
English
Institut
TORE-URI
Volume
65
Start Page
288
End Page
301
Citation
European Journal of Combinatorics (65): 288-301 (2017-10)
Publisher DOI
Scopus ID
We 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).