Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.07.070 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Embeddings,hypergraphs,pseudorandomness | Discrete mathematics,Combinatorics,Pseudorandomness,Constraint graph,Universality (philosophy),Lemma (mathematics),Mathematics,Pseudorandom number generator | Journal |
Volume | ISSN | Citations |
50 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshiharu Kohayakawa | 1 | 477 | 64.87 |
| G. O. Mota | 2 | 28 | 11.98 |
| Mathias Schacht | 3 | 361 | 37.90 |
| Anusch Taraz | 4 | 168 | 37.71 |