Counting results for sparse pseudorandom hypergraphs I
Combinatorics
2017-11-01 v1
Abstract
We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embedding graphs with bounded degree in sparse pseudorandom graphs, Israel J. Math. 139 (2004), 93-137]. Applications of our result are presented in the companion paper [Counting results for sparse pseudorandom hypergraphs II].
Keywords
Cite
@article{arxiv.1602.08782,
title = {Counting results for sparse pseudorandom hypergraphs I},
author = {Yoshiharu Kohayakawa and Guilherme O. Mota and Mathias Schacht and Anusch Taraz},
journal= {arXiv preprint arXiv:1602.08782},
year = {2017}
}