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; zbMATH DE number 6639929
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A counting lemma for sparse pseudorandom hypergraphs |
scientific article; zbMATH DE number 6639929 |
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
0 references
0.95843804
0 references
0.90762466
0 references
0 references
0.8995172
0 references
0.89661944
0 references
0.89109814
0 references
0.89037484
0 references
0 references
