| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651687 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
Abstract
We establish so-called counting lemmas that allow embeddings of certain hyper-graphs into sparse “pseudorandom” hypergraphs. As an application, we present a variant of a universality result of Rödl for sparse, 3-uniform hypergraphs contained in strongly pseudorandom hypergraphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
