A counting lemma for sparse pseudorandom hypergraphs (Q324872)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A counting lemma for sparse pseudorandom hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A counting lemma for sparse pseudorandom hypergraphs |
scientific article |
Statements
A counting lemma for sparse pseudorandom hypergraphs (English)
0 references
17 October 2016
0 references
embeddings
0 references
hypergraphs
0 references
pseudorandomness
0 references
