Counting results for sparse pseudorandom hypergraphs II

Aug 01, 2017

Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht and Anusch Taraz

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

The whole paper is available here.

Share on Twitter Share on Facebook