| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777413 | European Journal of Combinatorics | 2017 | 12 Pages |
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 (Kohayakawa et al., 2004). Applications of our result are presented in the companion paper (Counting results for sparse pseudorandom hypergraphs II).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz,