A counting lemma for sparse pseudorandom hypergraphs

Journal
Electronic notes in discrete mathematics  
Volume
50
Start Page
421
End Page
426
Citation
Electronic Notes in Discrete Mathematics (50): 421-426 (2015)
Contribution to Conference
LAGOS'15 – VIII Latin-American Algorithms, Graphs and Optimization Symposium  
Publisher DOI
10.1016/j.endm.2015.07.070
Scopus ID
2-s2.0-84953383661
Publisher
Elsevier Science
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.
Subjects
embeddings
hypergraphs
pseudorandomness
DDC Class
510: Mathematik