Counting results for sparse pseudorandom hypergraphs II

Publikationstyp

Journal Article

Date Issued

2017-10

Sprache

English

Author(s)

Kohayakawa, Yoshiharu

Mota, Guilherme Oliveira

Schacht, Mathias

Taraz, Anusch

Institut

Mathematik E-10

TORE-URI

http://hdl.handle.net/11420/3829

Journal

European journal of combinatorics

Volume

65

Start Page

288

End Page

301

Citation

European Journal of Combinatorics (65): 288-301 (2017-10)

Publisher DOI

10.1016/j.ejc.2017.04.007

Scopus ID

2-s2.0-85019625147

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).