Counting results for sparse pseudorandom hypergraphs II
Combinatorics
2017-11-01 v1
Abstract
We present a variant of a universality result of R\"odl [On universality of graphs with uniformly distributed edges, Discrete Math. 59 (1986), no. 1-2, 125-134] for sparse, -uniform hypergraphs contained in strongly jumbled hypergraphs. One of the ingredients of our proof is a counting lemma for fixed hypergraphs in sparse ``pseudorandom'' uniform hypergraphs, which is proved in the companion paper [Counting results for sparse pseudorandom hypergraphs I].
Cite
@article{arxiv.1602.08784,
title = {Counting results for sparse pseudorandom hypergraphs II},
author = {Yoshiharu Kohayakawa and Guilherme O. Mota and Mathias Schacht and Anusch Taraz},
journal= {arXiv preprint arXiv:1602.08784},
year = {2017}
}